A left part theorem for grammatical trees

DOI10.1016/0012-365X(79)90152-3zbMath0392.68061WikidataQ126471166 ScholiaQ126471166MaRDI QIDQ1251905

Anton Nijholt

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Context-Free GrammarsGrammatical TreesLeft Part Grammars

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45)

Related Items

Two iteration theorems for the LL(k) languages ⋮ Simple chain grammars and languages

Cites Work

• Normal forms of deterministic grammars
• Strict deterministic grammars
• On the Parsing of Deterministic Languages
• Simple LR(k) grammars
• Real-Time Strict Deterministic Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item