Normal forms of deterministic grammars

✍ Scribed by Matthew M. Geller; Michael A. Harrison; Ivan M. Havel

• Publisher: Elsevier Science
• Year: 1976
• Tongue: English
• Weight: 373 KB
• Volume: 16
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/s0012-365x(76)80004-0

✦ Synopsis

It is shown that every strict deterministic language may be given a strict deterministic grammar which is also in Greibach normal form. There are LR(0) languages which cannot he given LR(0) grammars in Greibach form. Every LR(k) grammar may be given an LR(I) grammar in Greibach form.