Re: [Caml-list] Array.make exception and parser

[Yitzhak Mandelbaum <yitzhakm@CS.Princeton.EDU>]

Daniel,

You're right about those transformations. Yet, when your grammar has hundreds of nonterminals, most or all with semantic actions attached, the transformations you describe can be quite tedious and error-prone.  Tools can certainly help here, but that would require people being familiar with them.  Its usually easier just to take Yacc for a spin than to go that effort. 

I'm not trying to advocate for one approach over another. I was just trying to answer your question about why people do the things they do.

Also, if you have any further questions, may I suggest we take it off the caml-list? I think we've wandered off-topic here. :-)

-- Yitzhak


On Jan 4, 2011, at 11:42 AM, Daniel Bünzli wrote:

>> A short answer (among many) to your particular question: it often requires a lot off effort just to discover whether " a recursive descent parser with some
>> combinators fits perfectly,"
> 
> Well I don't know what "a lot of effort" means to you. But IIRC my
> compiler course it's a matter of taking your EBNF grammar, eliminating
> left recursion and left factoring the grammar. If you can't do that
> with your grammar then you cannot parse it with LL(k).
> 
> Best,
> 
> Daniel
> 
> -- 
> Caml-list mailing list.  Subscription management and archives:
> https://sympa-roc.inria.fr/wws/info/caml-list
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
> 

-----------------------------
Yitzhak Mandelbaum