René Leermakers

Learn More
A novel formalism is presented for Earley-like parsers. I t accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-deterministlc LRoparsers for RTN grammars. 1 I n t r o d u c t i o n A major problem of computational linguistics is the inefficiency of parsing natural language. The most popular parsing(More)
A purely functional implementat ion of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the t ime-complexity of our parser is cubic if the functions that consti tute the parser are implemented as memo-functions, i.e. functions that memorize the results of(More)
  • 1