The current implementation of our PICO parser presents several limitations, such as:
(a) it only supports expressions using the prefix notation
(b) it does not deal with error situations in a user friendly way
(c) its code is a bit ugly, with several calls to the "blanks" function
We could improve the parser either using a more powerful combinator library (such as parsec or atoparsec) or a parser generator (such as bnfc). Another strategy is to just improve the current parser using our combinator library,
The current implementation of our PICO parser presents several limitations, such as:
(a) it only supports expressions using the prefix notation (b) it does not deal with error situations in a user friendly way (c) its code is a bit ugly, with several calls to the "blanks" function
We could improve the parser either using a more powerful combinator library (such as parsec or atoparsec) or a parser generator (such as bnfc). Another strategy is to just improve the current parser using our combinator library,