Context free grammars were introduced as a formalism to specify context free languages by Chomsky and Schutzenberger1. It is a structural description of strings that belong to a given language. Multiple can exist that specify the same context free language. More importantly, a given context free grammar can also be used as a recognizer for a given context free language. Numerous algorithms exist 2 3 4 that when given a context free grammar, can recognize whether any given string belongs to the corresponding context free language. A recognizer checks whether a given string is in a given language. A parser recovers the structure(s) of such a string if it is a member of such a language. A string may have multiple structures if the grammar is ambiguous. Ruzzo 5 shows how one can turn a recognizer into a parser (that recovers one parse of the string) with $$O(log n)$$ effort where $$n$$ is the length of the string.

Ruzzo further shows that the all-parses problem (Generating a convenient representation of a string parse from which all parses of the string can be obtained.) is solvable in linear time (in terms of the length of input) only if Boolean matrix multiplication of two $$n\times n$$ matrices can be done in $$O(n^2)$$ time. Valient 6 showed that context free recognition of $$n$$ character strings can be carried out at least as fast as multiplication of two $$n\times n$$ Boolean matrices.

Das et al.7 shows that the lower bound for multiplication of two $$n\times n$$ Boolean matrices is at least $$\Omega(n^3/2^{O(\sqrt{log n})})$$ which is greater than $$O(n^2)$$.

Parsing Expression Grammars (PEGs) are an alternative means of specifying the membership criteria for a language. It was formalized by Ford in 2004 8. Note that while not formalized, it was recognized much earlier that limited backtracking can make parsing easy. For example, Aho et al.9 showed that recognition using TDPL/GTPL which are equivalent to PEGs in power can be done in $$O(n)$$ time where $$n$$ is the length of the input. Further, Burge10 – (Top down parsing with limited backtracking page 177) describes the ordered choice algorithm, and describes the limitations of this approach.

The question that one can now ask is, does there exist a context free language such that its recognition can be achieved only in greater than $$O(n)$$ time. If such a language exist, then a PEG representation cannot exist for that language.

Note that these results on parsing and recognition are all for context free grammars. So, can we translate our above question to context free grammars? Say we have an arbitrary context free grammar. Say, the recognition using this context free grammar can be done in $$O(m)$$ time which is greater than $$O(n)$$ time using a BMM encoding. Can there exist a different context free grammar that allows a polynomially faster recognition? If such a context free grammar exists, then we can solve an arbitrary BMM problem by finding a context free grammar that will solve it faster.

The other direction to go is to find a CFL that is not under PEG. The current best bet is the palindrome language. Given two alphabets 0 and 1, the palindrome language can be defined as:

$S\rightarrow 1S1\mid 0S0\mid 1\mid 0 \mid \epsilon$

The reason palindromes are interesting is that, it hits upon the central characteristic of PEGs and CFGs. Namely, PEGs require matching the longest prefix first, and the next prefix is checked if and only if the first prefix fails. CFGs on the other hand, have no defined ordering. To parse an arbitrary palindrome, CFG can start matching the shortest possible expansion, and then try with longer and longer expansions (with larger stacks of S). With PEG, to match a given palindrome, one needs some way to compute an arbitrary pattern (the left prefix of the mirror expansion). This likely require a Turing machine. The spoiler here is that, PEGs may be in some sense universal 11.

# References

1. Noam Chomsky and Marcel P Schützenberger. “The algebraic theory of context-free languages”. In:Studies in Logic and the Foundations of Mathematics.Vol. 26. Elsevier, 1959, pp. 118–161

2. Daniel H Younger. “Recognition and parsing of context-free languages in time n3”. In:Information and control 10.2 (1967), pp. 189–208

3. Jay Earley. “An Efficient Context-free Parsing Algorithm”. In:Communications of the ACM 13.2 (Feb. 1970), pp. 94–102.ISSN: 0001-0782.DOI:10.1145/362007.362035.URL:http://doi.acm.org/10.1145/362007.362035

4. Masaru Tomita. “An Efficient Context-Free Parsing Algorithm for Natural Languages.” In:IJCAI. Vol. 2.1985, pp. 756–764

5. Walter L Ruzzo. “On the complexity of general context-free language parsing and recognition”. In:International Colloquium on Automata, Languages,and Programming. Springer. 1979, pp. 489–497.

6. Leslie G Valiant. “General context-free recognition less than cubic time”. In:Journal of computer and system sciences 10.2 (1975), pp. 308–315.

7. Debarati Das, Michal Koucký, and Michael E.Saks. “Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication”. In:CoRRabs/1801.05202 (2018). arXiv:1801.05202.URL:http://arxiv.org/abs/1801.05202

8. Bryan Ford. “Parsing Expression Grammars: A Recognition-based Syntactic Foundation”. In:SIG-PLAN Not.39.1 (Jan. 2004), pp. 111–122.ISSN: 0362-1340.

9. Alfred V Aho and Jeffrey D Ullman.The theory of parsing, translation, and compiling. Vol. 1. Prentice-Hall Englewood Cliffs, NJ, 1972

10. William. H. Burge. Recursive programming techniques. Reading, Mass. : Addison-Wesley Pub. Co, 1975

11. Bruno Loff, Nelma Moreira, Rogério Reis “The computational power of parsing expression grammars” 2019 arXiv:1902.08272 .URL:https://arxiv.org/abs/1902.08272