A new proof technique to establish equivalence of the original and the generated lambda-free CFG with linear increase in size

DOI10.1007/BF01934392zbMath0478.68079OpenAlexW2089359920MaRDI QIDQ1161305

Jainendra K. Navlakha

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934392

zbMATH Keywords

context-free grammarderivation trees22, 17-26 (1982)elimination of empty productionsequivalent grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On the equivalence, containment, and covering problems for the regular and context-free languages
• Optimization of LR(k) parsers
• Unnamed Item

This page was built for publication: A new proof technique to establish equivalence of the original and the generated lambda-free CFG with linear increase in size