Syntax-directed least-errors analysis for context-free languages
From MaRDI portal
Publication:4776859
DOI10.1145/360767.360771zbMath0288.68041OpenAlexW2066856273MaRDI QIDQ4776859
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360767.360771
Related Items (13)
Incremental parsing in language-based editors: user needs and how to meet them ⋮ Weighted Deductive Parsing and Knuth's Algorithm ⋮ A note on some tree similarity measures ⋮ An error-correcting syntactic decoder for computer networks ⋮ Approximately matching context-free languages ⋮ Automatic correction of syntax-errors in programming languages ⋮ A formal frame for robust parsing ⋮ LL(1) grammars supporting an efficient error handling ⋮ The intractability of computing the Hamming distance ⋮ Error-repair parsing schemata ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ How hard is computing the edit distance? ⋮ Approximate matching between a context-free grammar and a finite-state automaton
This page was built for publication: Syntax-directed least-errors analysis for context-free languages
