Parsing algorithms with backtrack

DOI10.1016/S0019-9958(73)90851-6zbMath0296.68019OpenAlexW1984577612MaRDI QIDQ4050096

Jeffrey D. Ullman, Alexander Birman

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

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

Related Items (7)

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

This page was built for publication: Parsing algorithms with backtrack