http://shaurz.wordpress.com/2008/03/11/haskell-style-parser-combinators-in-scheme/ Thu, 15 May 2008 04:42:11 +0000 http://wordpress.org/?v=MU http://shaurz.wordpress.com/2008/03/11/haskell-style-parser-combinators-in-scheme/#comment-458 shaurz Sun, 04 May 2008 05:19:06 +0000 http://shaurz.wordpress.com/?p=16#comment-458 I haven't used them in practice (this is my first stab at implementing them), but I like the idea. Most of the parsers I've written were good old recursive descent. PEGs also interest me (especially the work of VPRI & co), and they which have a nice solution to the left-recursion problem. I haven’t used them in practice (this is my first stab at implementing them), but I like the idea. Most of the parsers I’ve written were good old recursive descent. PEGs also interest me (especially the work of VPRI & co), and they which have a nice solution to the left-recursion problem.

]]> http://shaurz.wordpress.com/2008/03/11/haskell-style-parser-combinators-in-scheme/#comment-457 Adrian Kuhn Tue, 29 Apr 2008 01:33:40 +0000 http://shaurz.wordpress.com/?p=16#comment-457 Hehe, these parser combinators really seem to generate quite some noise these days. Cool to see that people like them ... I have written all my parsers that way since years, but only learned of the proper term some months ago via gilad. Hehe, these parser combinators really seem to generate quite some noise these days. Cool to see that people like them … I have written all my parsers that way since years, but only learned of the proper term some months ago via gilad.

]]>