A direct algorithm for checking equivalence of LL(k) grammars

Tmima Olshansky, Amir Pnueli
1977 Theoretical Computer Science  
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 so!ved it by reductiorl into an equivalence Frobiem fur special DPDA's. In a paper by Korenjak and Hopcroft [l] the equivalence problem for LL(l) 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. LL(k)
more » ... From now on e will call a cfg simply a grammar-In the sequel we will fix our 324
doi:10.1016/0304-3975(77)90016-0 fatcat:fa6brcyxrrejvflfzoi4tjs2wy