SLR(1) and LALR(1) parsing for unrestricted grammars

DOI10.1007/BF00264364zbMath0634.68080OpenAlexW1993575201MaRDI QIDQ1097044

Lawrence A. Harris

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

LALR(1) automatonLALR(1) parsingSLR(1) automatonSLR(1) parsingunrestricted grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

This page was built for publication: SLR(1) and LALR(1) parsing for unrestricted grammars