Pages that link to "Item:Q1243139"
From MaRDI portal
The following pages link to A class of linearly parsable graph grammars (Q1243139):
Displaying 5 items.
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars (Q2947208) (← links)
- Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms (Q4921557) (← links)