LR-parsing derived

DOI10.1016/0167-6423(92)90007-XMaRDI QIDQ1196299zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 16 December 1992

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(92)90007-x

zbMATH Keywords

\(\text{LR}(k)\)-parsing algorithmfinite automatonprogram developmentright most derivationsweakest angelic precondition

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• LR parsing for LCFRS
• scientific article; zbMATH DE number 4100631
• A functional LR parser
• LR parsing for conjunctive grammars
• Looping LR parsers
• Developments in Language Theory
• Derivatives of parsing expression grammars

Cited in

(3)

• Angelic processes for CSP via the UTP
• On the reduction of \(LR(k)\) parsers
• Alternating states for dual nondeterminism in imperative programming

This page was built for publication: LR-parsing derived

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