论文信息 - Implementation of Tamias to Check Production Rules for Parsing Expression Grammar

Implementation of Tamias to Check Production Rules for Parsing Expression Grammar

Backus–Naur Form (BNF) can express type-2 grammar (CFG: Context-Free Grammar) in the Chomsky hierarchy. Although BNF is traditionally used in the syntax definition of programming languages, it is possible to describe ambiguous grammar (e.g. dangling-else problem). The ambiguous grammar is not allowed programming languages because the compiler would interpret multiple languages. Unfortunately, it has been proved that there is no algorithm to judge that the CFG contains ambiguous grammar [1,2].

[1] Robert W. Floyd,et al. On ambiguity in phrase structure languages , 1962, CACM.

[2] David G. Cantor,et al. On The Ambiguity Problem of Backus Systems , 1962, JACM.

[3] Bryan Ford,et al. Packrat Parsing: Simple, Powerful, Lazy, Linear Time , 2006, ICFP 2002.

[4] Bryan Ford,et al. Parsing expression grammars: a recognition-based syntactic foundation , 2004, POPL '04.

[5] Roman R. Redziejowski. Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking , 2007, Fundam. Informaticae.