On a recursive ascent parser

DOI10.1016/0020-0190(88)90061-0MaRDI QIDQ1114420zbMATH OpenOpenAlexFDO

Authors 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)

Review text

A recursive parsing algorithm is presented which is the analogue to a bottom-up parsing strategy of what is the recursive descent parsing algorithm to a dop-down parsing strategy.

Cites work

• scientific article; zbMATH DE number 3837340 (Why is no real title available?)
• Optimization of LR(k) parsers

Cited in

(5)

• A recursive ascent Earley parser
• Recursive ascent parsing: From Earley to Marcus
• A functional LR parser
• Recursive descent parsing for Boolean grammars
• scientific article; zbMATH DE number 5201499 (Why is no real title available?)

This page was built for publication: On a recursive ascent parser

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114420)