Simple chain grammars and languages

DOI10.1016/0304-3975(79)90032-XzbMath0409.68046MaRDI QIDQ1259175

Anton Nijholt

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

ParsingContext-Free GrammarsSimple Chain GrammarsSimple Deterministic Grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items

On the relationship between the LL(k) and LR(k) grammars

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