论文信息 - A Direct Algorithm for Checking Equivalence of LL(k) Grammars

A Direct Algorithm for Checking Equivalence of LL(k) Grammars

Abstract We deal with the problem of testing equivalence of two LL( k ) grammars. The problem had been shown to be decidable for general k by Rosenkrantz and Stearns [2], who solved it by reduction into an equivalence problem for special DPDA's. In a paper by Korenjak and Hopcroft [1] the equivalence problem for LL(1) grammars is solved by a branching algorithm operating directly on the grammars. Our work presents a direct branching algorithm for the general LL( k ) grammars equivalence problem.

Amir Pnueli | Tmima Olshansky

[1] Bruno Courcelle. Recursive Schemes, Algebraic Trees and Deterministic Languages , 1974, SWAT.

[2] Zvi Galil. Functional Schemas with Nested Predicates , 1975, Inf. Control..

[3] Leslie G. Valiant,et al. Decision procedures for families of deterministic pushdown automata , 1973 .

[4] Stephen J. Garland,et al. Program Schemes, Recursion Schemes, and Formal Languages , 1973, J. Comput. Syst. Sci..

[5] Zohar Manna,et al. Decidable Properties of Monadic Functional Schemas , 1973, JACM.

[6] Bruno Courcelle,et al. Completeness Results for the Equivalence of Recursive Schemas , 1976, J. Comput. Syst. Sci..

[7] Daniel J. Rosenkrantz,et al. Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[8] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .