Regular right part grammars and their parsers

DOI10.1145/359842.359853zbMath0399.68076OpenAlexW2062303078MaRDI QIDQ4184351

Wilf R. LaLonde

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359842.359853

zbMATH Keywords

ParsersProgramming LanguagesRegular ExpressionsNondeterministic Finite State MachinesPascal Syntax DiagramsRegular Right Part Grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) General topics in the theory of software (68N01)

Related Items (9)

Characterization of extended \(\mathrm{LR}(k)\) grammars ⋮ A simple realization of LR-parsers for regular right part grammars ⋮ Deterministic regular languages ⋮ Parsing extended LR(k) grammars ⋮ An improved LALR\((k)\) parser generation for regular right part grammars ⋮ Efficient recognition of trace languages defined by repeat-until loops ⋮ Towards a Taxonomy for ECFG and RRPG Parsing ⋮ LALR(1,1) parser generation for regular right part grammars ⋮ Generation of efficient LALR parsers for regular right part grammars

This page was built for publication: Regular right part grammars and their parsers