A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

DOI10.1016/0304-3975(91)90180-AzbMath0728.68078OpenAlexW2058476719WikidataQ56047567 ScholiaQ56047567MaRDI QIDQ805244

Joop M. I. M. Leo

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90180-a

zbMATH Keywords

linear complexityLR(k) grammarsLR regular grammarsparsing algorithm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Unnamed Item
• Unnamed Item
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• An Improved Context-Free Recognizer
• Recognition and parsing of context-free languages in time n3
• An efficient context-free parsing algorithm