On a recursive ascent parser

DOI10.1016/0020-0190(88)90061-0zbMath0662.68081OpenAlexW2149066449MaRDI QIDQ1114420

S. H. Smith

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90061-0

zbMATH Keywords

bottom-up parsingrecursive parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items

A recursive ascent Earley parser, Recursive ascent parsing: From Earley to Marcus, A functional LR parser

Cites Work

• Optimization of LR(k) parsers
• Unnamed Item