LR-parsing derived

DOI10.1016/0167-6423(92)90007-XzbMath0768.68086OpenAlexW2053254056MaRDI QIDQ1196299

Wim 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

finite automatonprogram development\(\text{LR}(k)\)-parsing algorithmright most derivationsweakest angelic precondition

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (2)

Angelic processes for CSP via the UTP ⋮ Alternating states for dual nondeterminism in imperative programming

This page was built for publication: LR-parsing derived