Comments for Perpetual Weekend

Comment on Haskell-style Parser Combinators in Scheme by shaurz

shaurz — Sun, 04 May 2008 05:19:06 +0000

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.

Comment on Haskell-style Parser Combinators in Scheme by Adrian Kuhn

Adrian Kuhn — Tue, 29 Apr 2008 01:33:40 +0000

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.

Comment on Forth as a Haskell DSL, or Lambda: The Ultimate Stack? by shaurz

shaurz — Sun, 04 Mar 2007 22:12:40 +0000

Jay, my definition of ‘over’ works, but I think I might have the direction of the stack diagrams messed up. It should probably be:

over k a b = k b a b

P.S. I’m just an amateur too :-)

Comment on Forth as a Haskell DSL, or Lambda: The Ultimate Stack? by shaurz

shaurz — Sun, 04 Mar 2007 22:07:45 +0000

Chung-chieh, thanks for the links. I will check them out. Sorry for the delay in you comment appearing, I had to approve it since it had > 2 links.

Comment on Forth as a Haskell DSL, or Lambda: The Ultimate Stack? by Jay Hermans

Jay Hermans — Sun, 04 Mar 2007 20:51:47 +0000

I’m an amateur but I think Over kba = kbab, not kaba.

Comment on Forth as a Haskell DSL, or Lambda: The Ultimate Stack? by Chung-chieh Shan

Chung-chieh Shan — Sun, 04 Mar 2007 06:34:26 +0000

Chris Okasaki. 2002. Techniques for embedding postfix
languages in Haskell. In Proceedings of the 2002 Haskell
workshop, ed. Manuel M. T. Chakravarty, 105-113. New York: ACM
Press.

Code
ACM

Comment on Adventures in Booting Up by el che

el che — Sat, 17 Feb 2007 22:43:41 +0000

w00 yeah!