A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars

Abstract We present here an equivalence checking algorithm which operates directly on a pair of strict deterministic vs. LL( k ) grammars. It is also straightforwardly applicable to a pair of LL( k ) grammars, though an LL( k ) grammar is not necessarily strict deterministic. The basic idea is from Korenjak and Hopcroft's branching algorithm for simple deterministic grammars, but ours is so distinguished that it is throughout free from mixing the nonterminals of the respective grammars in question and then very simple.

[1]  Oscar H. Ibarra,et al.  On the Decidability of Equivalence for Deterministic Pushdown Transducers , 1981, Inf. Process. Lett..

[2]  Leslie G. Valiant.  The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[3]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[4]  Tadao Kasami,et al.  A Result on the Equivalence Problem for Deterministic Pushdown Automata , 1976, J. Comput. Syst. Sci..

[5]  Derick Wood,et al.  Some remarks on the KH algorithm fors-grammars , 1973 .

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

[7]  Esko Ukkonen.  A decision method for the equivalence of some non-real-time deterministic pushdown automata , 1980, STOC '80.

[8]  Ivan M. Havel,et al.  Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..

[9]  Ivan M. Havel,et al.  Real-Time Strict Deterministic Languages , 1972, SIAM J. Comput..

[10]  Michio Oyamaguchi,et al.  The Equivalence Problem for Real-Time Strict Deterministic Languages , 1980, Inf. Control..

[11]  Sheila A. Greibach,et al.  Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems , 1979, J. Comput. Syst. Sci..

[12]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[13]  Amiram Yehudai,et al.  On Equivalence of Grammars Through Transformation Trees , 1979, Theor. Comput. Sci..

[14]  Matti Linna,et al.  Two Decidability Results for Deterministic Pushdown Automata , 1979, J. Comput. Syst. Sci..

[15]  Leslie G. Valiant.  The decidability of equivalence for deterministic finite-turn pushdown automata , 1974, STOC '74.

[16]  Ivan M. Havel,et al.  On the Parsing of Deterministic Languages , 1974, JACM.

[17]  Catriel Beeri.  An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines , 1976, Theor. Comput. Sci..

[18]  Michio Oyamaguchi,et al.  The Decidability of Equivalence for Determistic Stateless Pushdown Automata , 1978, Inf. Control..

[19]  Amir Pnueli,et al.  A Direct Algorithm for Checking Equivalence of LL(k) Grammars , 1977, Theor. Comput. Sci..

[20]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

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

[22]  Etsuji Tomita.  A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata , 1982, Inf. Control..