Simple chain grammars and languages
From MaRDI portal
Publication:1259175
DOI10.1016/0304-3975(79)90032-XzbMath0409.68046MaRDI QIDQ1259175
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Normal forms of deterministic grammars
- On LR(k) grammars and languages
- On the covering of parsable grammars
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- A left part theorem for grammatical trees
- Top-down syntax nalysis
- A note on the number of states of the De Remer's recognizer
- Strict deterministic grammars
- On the Parsing of Deterministic Languages
- The theory of left factored languages: part 2
- Simple LR(k) grammars
- Design of a separable transition-diagram compiler
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item