A formal frame for robust parsing

DOI10.1016/j.tcs.2004.07.013zbMath1071.68053OpenAlexW1972629932WikidataQ57765026 ScholiaQ57765026MaRDI QIDQ703512

F. J. Ribadas, J. Vilares, V. M. Darriba, Manuel Vilares

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.013

zbMATH Keywords

Dynamic programmingRobust parsingPush-down automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

A predictive bottom-up parser ⋮ Error-repair parsing schemata

Cites Work

• Unnamed Item
• Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
• Syntax-directed least-errors analysis for context-free languages