Functional Parsers
Jero en Fokker
Dept of Computer Science Utrecht University
P O Box TB Utrecht The Netherlands
e mail jero en cs ruu nl
Abstract In an informal way the list of successes metho d for writ
ing parsers using a lazy functional language Gofer is describ ed The
library of higher order functions known as parser combinators that
is developed is used for writing parsers for nested parentheses and op
erator expressions with an arbitrary number of priorities The metho d
is applied on itself to write a parser for grammars that yields a parser
for the language of the grammar In the text exercises are provided the
solutions of which are given at the end of the article