Syntax-directed least-errors analysis for context-free languages

DOI10.1145/360767.360771MaRDI QIDQ4776859zbMATH OpenOpenAlexFDO

Authors Gordon Lyon

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

Mathematics Subject Classification ID

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

Cited in

(14)

• A note on some tree similarity measures
• Automatic correction of syntax-errors in programming languages
• LL(1) grammars supporting an efficient error handling
• How hard is computing the edit distance?
• Error-repair parsing schemata
• Approximate matching between a context-free grammar and a finite-state automaton
• Weighted Deductive Parsing and Knuth's Algorithm
• An error-correcting syntactic decoder for computer networks
• Incremental parsing in language-based editors: user needs and how to meet them
• The intractability of computing the Hamming distance
• Input-driven pushdown automata for edit distance neighborhood
• String editing under pattern constraints
• Approximately matching context-free languages
• A formal frame for robust parsing

This page was built for publication: Syntax-directed least-errors analysis for context-free languages

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