Title :
LR(k) testing is average case complete
Author_Institution :
Ulm Univ., Germany
Abstract :
In this note, we show that LR(k) testing of context free grammars with respect to random instances is many-one complete for Distributional NP. The same result holds for testing whether a context free grammar is LL(k), strong LL(k), SLR(k), LC(k) or strong LC(k), respectively
Keywords :
computational complexity; context-free grammars; LR(k) testing; average case complete; context free grammars; distributional NP; many-one complete; random instances; Complexity theory; Computational complexity; Computer aided software engineering; Computer science; Cryptography; Distributed computing; Mathematics; NP-complete problem; Polynomials; Testing;
Conference_Titel :
Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference)
Conference_Location :
Ulm
Print_ISBN :
0-8186-7907-7
DOI :
10.1109/CCC.1997.612303
