2 papers
cs.CL2004
CHR Grammars
Henning Christiansen
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom…
cs.PL2001
CHR as grammar formalism. A first report
Henning Christiansen
Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguit…