Hello Alex,

Thursday, September 22, 2005, 1:57:03 PM, you wrote:

I'm  developing  a  RD  parser  generator  (YARD)  in  pure Ocaml that
combines  modern  ideas  about functional parsers. I have not analyzed
the  class  of  grammars  being parsed but it is wider then CFG. Smth
about left attributed but I am not ready to discuss this topic.
Short example of rule `iter' that applies argument `a' `n' times:

iter[a n] : => n > 0 =>   <hd> = a  <tl> = iter[ a  (n - 1)] {hd::tl}
           | => n = 0 => {[]}
(  `=> ... =>' is a predicate/guardian, `<..>' is a binding)
           
Do you believe that this kind of parsers are able to parse SQL?

YARD  is open source project, but I have not published sources yet but
if somebody is interested I will. Generator (YARD) is ready to be used
and is being used in our projects, but it rapidly changes =). YARD

AB> I am getting very much annoyed with the obtusity of the LALR-yacc parser
AB> generators. I have unsurmountable difficulties at teaching ocamlyacc how
AB> to parse SQL decently.

AB> What is the "way to go" in terms of parser generators for Ocaml? I'd
AB> like to see if there is some level of agreement in the community on this
AB> issue.

AB> Alex





Best regards,
 Jake                            mailto:jake@freemail.ru