MODULAR SYNTAX DEMANDS VERIFICATION
Sylvain Schmitz · 2006
Modular grammatical formalisms provide an essential step towards improved grammar engineering practices. However, as we depart from traditional deterministic models, some intrinsic static checks are lost. The paper shows why grammar verification is necessary for reliable uses of context-free grammars (CFGs) and parsing expression grammars (PEGs) as modular syntax definitions. Simple conservative verification procedures are presented for each formalism.