Stackless & String-processing

[Graham Matthews]

Tim Peters (tim_one at email.msn.com) wrote:
: A nice paper on Clean parsing combinators can be downloaded as item 5 
: > 
: Interestingly enough, the next paper on the list ("An Interpreter") declines
: to use  combinators for its parsing task, instead building a conventional
: "by hand" recursive descent parser.

Yes it's kind of strange that they don't use the combinators to build
the interpreter. One of Peyton-Jones' papers has a good (but small) 
example of making an interpreter with combinators (it's probably the
first paper of his on monads). 

Tim Peters (tim_one at email.msn.com) wrote:
: another-two-years-and-they'll-discover-lex/yacc<wink>-ly y'rs  - tim

I'll take that as a BIG <wink>. Once you use these combinators you will
never go back to lex/yacc (unless you want LALR(n) grammars).

graham
-- 
            The girls is all salty, the boys is all sweet, 
                      the food ain't too shabby 
                    an' they piss in the streets
    In France, way down in France, way on down, way on down in France