CW 594

Dominique Devriese and Frank Piessens
Explicitly recursive grammar combinators - The implementation of some grammar algorithms - Technical report


In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar's recursion, decoupling the grammar from its semantic actions and making semantic actions independent of matching order. In this technical report, we present the implementation of some interesting grammar algorithms in order to provide evidence for the increased power and declarative style of our novel grammar representation. The presented code is a simplification of parts of our freely available Haskell library grammar-combinators.

report.pdf (376K) / mailto: D. Devriese