These pages written, maintained, and © by Atze Dijkstra.

What?

The package nl.uu.cs.parsercombinator offers parser combinators written in Java. The package is based upon the combinators written for Hugs used used in the course Grammatica's en Ontleden, including some of the examples used in the course. The current version (0.9) is a demo version, to see if it would work and to be looked at by students following the course Grammatica's en Ontleden.

Why?

Ever used yacc + lex or equivalents? And thrilled with the speed or integration with the used language (like C, C++, Java) but frustrated by the difficulty of manipulating higher-order concepts like abstract syntax trees? Or you did use a functional programming language like Haskell in which parsercombinators can be used easily to create and manipulate grammars and the parsing of text described by a parser. But you could not find a way to incorporate a parser combinator in a production program written in an imperative language? This package hopes to combine best of both worlds: parser combinators written in Java.

Design

To be done.

Availability

Currently you can have a look at the demo applet and download the sources. No guarantees, this is experimental quality, not finished product quality.

Downloading

• 20000127-0_9-JPC-distr.zip (132k). The sources and jar file for the applet.