Graph representation of context-free grammars
Alex Shkotin

TL;DR
This paper explores the use of graph representations for context-free grammars, highlighting their mathematical properties and potential for extensions like attributes, to enhance understanding and processing of such grammars.
Contribution
It introduces a graph-based framework for representing context-free grammars, facilitating analysis and extensions in a unified mathematical setting.
Findings
Graphs can effectively represent CF-grammars
Graph properties aid in grammar analysis
Extensions like attributes are compatible with graph representations
Abstract
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations for CF-grammars. Furthermore, graph are well adapted to various extensions (one kind of such extensions being attributes).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Semantic Web and Ontologies
