Abstract
A number of results are presented on the complexity of structural equivalence and containment for context-free grammars. These results include the following:1Testing for any of a wide range of structural similarity relations for grammars, including structural containment and equivalence, is PSPACE-hard.2Two 2O(n) time algorithms are presented for structural containment and equivalence.1Several different classes of grammars are identified for which structural containment and equivalence are provably “as hard as” structural containment and equivalence for arbitrary grammars.1Several different classes of grammars are identified for which structural containment and equivalence are provably solvable in polynomial time. These classes include the structurally unambiguous linear grammars, the LL(k) grammars and the BRC(m, n) grammars.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
