ABNF Parser Generator

Hi All,


I'm new to this group and new to the business of parser
generators. I've recently written a parser generator which takes any
RFC2234-compliant ABNF grammar and produces a C++ recursive-decent
parser with a call back function for each rule name. The call back
functions can be used for user-written syntactic actions and
user-written resolution of alternates with ambiguous prefixes. It does
fairly extensive grammar checking and recursion analysis and has been
tested on a variety of grammars from simple to complex.


I know that parser generation is a mature field and that many tools
exist, but searching the web and this group for ABNF-specific tools
doesn't seem to turn up much. I would be very interested in knowing if
similar tools exist or whether there is any interest in such a tool.


I've perused a number of the parser generator descriptions, here and
elsewhere, but don't see any that use ABNF grammar descriptions or the
call back function approach to interface the user with the
parser. However, the shear number of them is daunting. I would be very
interested in comments, tips, critiques, etc. from others more
experienced in the field. The full description and source code with
examples is available at http://www.coasttocoastresearch.com
<http://www.coasttocoastresearch.com>/.


Thanks,
Lowell Thomas

Return to the comp.compilers page.
Search the comp.compilers archives again.