Re: parser
- From: "Bartc" <bc@xxxxxxxxxx>
- Date: Wed, 10 Sep 2008 21:34:43 GMT
"Jon Harrop" <jon@xxxxxxxxxxxxxxxxx> wrote in message news:_vqdnUofQ8c4cFrVnZ2dnUVZ8qXinZ2d@xxxxxxxxx
Bartc wrote:"Jon Harrop" <jon@xxxxxxxxxxxxxxxxx> wrote in message
news:UvKdnVhbJssHKlrV4p2dnAA@xxxxxxxxx
[ "while"; p=expr; "do"; b=expr; "od" ->
I have to take your word that this does what you say it does.
You can verify that it works for yourself:
http://brion.inria.fr/gallium/index.php/Camlp4
Again, all I could see was an example for a trivial language.
But I came across this from: http://flint.cs.yale.edu/cs421/case-for-ml.html:
"...10. Did I mention that Ocaml is fast? I wrote a compiler for
an actuarial financial modelling language in Ocaml, probably
10K lines of code, that would have been 20K or more in C++,..."
This 2:1 factor sounds more reasonable than your 10:1 claim, and is in line with your figures in another post.
--
Bartc
.
- Follow-Ups:
- Re: parser
- From: Jon Harrop
- Re: parser
- References:
- parser
- From: Bill Cunningham
- Re: parser
- From: Pascal J. Bourguignon
- Re: parser
- From: Bill Cunningham
- Re: parser
- From: Jon Harrop
- Re: parser
- From: Bill Cunningham
- Re: parser
- From: Jon Harrop
- Re: parser
- From: Bartc
- Re: parser
- From: Jon Harrop
- Re: parser
- From: Bartc
- Re: parser
- From: Jon Harrop
- Re: parser
- From: Bartc
- Re: parser
- From: Jon Harrop
- parser
- Prev by Date: Re: Solve (or code) once for all
- Next by Date: Re: parser
- Previous by thread: Re: parser
- Next by thread: Re: parser
- Index(es):