On the covering of parsable grammars
From MaRDI portal
Publication:1239012
DOI10.1016/S0022-0000(77)80027-5zbMath0357.68087MaRDI QIDQ1239012
Publication date: 1977
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items (6)
A survey of normal form covers for context-free grammars ⋮ A method for transforming grammars into LL(k) form ⋮ On the covering of parsable grammars ⋮ From left-regular to Greibach normal form grammars ⋮ Simple chain grammars and languages ⋮ SLR(k) covering for LR(k) grammars
Cites Work
- Unnamed Item
- On LR(k) grammars and languages
- On the covering of parsable grammars
- Strict deterministic grammars
- On the Parsing of Deterministic Languages
- On the Complete Covering Problem for LR ( k )Grammars
- Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
- On the Covering and Reduction Problems for Context-Free Grammars
This page was built for publication: On the covering of parsable grammars
