Syntax-Directed Least-Errors Analysis for Context-Free Languages: A Practical Approach A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of context-free grammars as drivers, and any finite string as input. Recognition consists of a least-errors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it. CACM January, 1974 Lyon, G. arbitrary input strings, context-free grammars, parsing, dynamic programming, stored subanalyses, separability, state merging, least-errors correction 4.12 5.23 5.42 CA740101 JB January 18, 1978 2:57 PM 1225 4 2698 1323 4 2698 1350 4 2698 1358 4 2698 1379 4 2698 1380 4 2698 1542 4 2698 1646 4 2698 1665 4 2698 1665 4 2698 1683 4 2698 1693 4 2698 1693 4 2698 1768 4 2698 1781 4 2698 1781 4 2698 1781 4 2698 1781 4 2698 1787 4 2698 1787 4 2698 1787 4 2698 1824 4 2698 1825 4 2698 1836 4 2698 1836 4 2698 1836 4 2698 1861 4 2698 1945 4 2698 1945 4 2698 1945 4 2698 1989 4 2698 1989 4 2698 2015 4 2698 2015 4 2698 2060 4 2698 2060 4 2698 2060 4 2698 2061 4 2698 2061 4 2698 2082 4 2698 2091 4 2698 2091 4 2698 2110 4 2698 2112 4 2698 2127 4 2698 2152 4 2698 2179 4 2698 2179 4 2698 2179 4 2698 2187 4 2698 2317 4 2698 2340 4 2698 2356 4 2698 2534 4 2698 2541 4 2698 2545 4 2698 2546 4 2698 2546 4 2698 2603 4 2698 2650 4 2698 2698 4 2698 2698 4 2698 2698 4 2698 2698 4 2698 2698 4 2698 2698 4 2698 2698 4 2698 2708 4 2698 2708 4 2698 2708 4 2698 2708 4 2698 2733 4 2698 2733 4 2698 2820 4 2698 2824 4 2698 2921 4 2698 2982 4 2698 2986 4 2698 3045 4 2698 3045 4 2698 3073 4 2698 3093 4 2698 3093 4 2698 3155 4 2698 3154 4 2698 1477 5 2698 1491 5 2698 1781 5 2698 2110 5 2698 2556 5 2698 2698 5 2698 2698 5 2698 2698 5 2698 680 5 2698 799 5 2698