Parsing algorithms with backtrack

DOI10.1016/S0019-9958(73)90851-6MaRDI QIDQ4050096zbMATH OpenOpenAlexFDO

Authors Alexander Birman, Jeffrey D. Ullman

Publication date 1973

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(73)90851-6

Mathematics Subject Classification ID

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

Cited in

(7)

• A linear-time simulation of deterministic \(d\)-limited automata
• Linear parsing expression grammars
• Grammars for Indentation-Sensitive Parsing
• A survey of state vectors
• Recursive descent parsing for Boolean grammars
• Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
• Linear grammars with one-sided contexts and their automaton representation

This page was built for publication: Parsing algorithms with backtrack

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