RE: Parser generator for package based protocols

"Lowell Thomas" <lowell@coasttocoastresearch.com>
30 Apr 2006 18:36:02 -0400

          From comp.compilers
Related articles
Parser generator for package based protocols torbjoern.mattsson@gmail.com (2006-04-28)
RE: Parser generator for package based protocols lowell@coasttocoastresearch.com (Lowell Thomas) (2006-04-30)
| List of all articles for this month |
From: "Lowell Thomas" <lowell@coasttocoastresearch.com>
Newsgroups: comp.compilers
Date: 30 Apr 2006 18:36:02 -0400
Organization: Compilers Central
References: 06-04-169
Keywords: lex, parse
Posted-Date: 30 Apr 2006 18:36:02 EDT

You might take a look at APG - an ABNF Parser Generator
(www.coasttocoastresearch.com). It was originally developed with
communication protocols in mind, even though I have of late been
working on a compiler demonstration. (And, yes, they are a much
simpler problem than languages like C/C++.) It has a non-reciprocal
Open Source license, and will work with any well-behaved(*) grammar
that can be expressed as ABNF. APG comes with examples of using it
with the SIP and SDP protocols. The examples are not complete message
parsers but give a good start, showing how a person might go about
building them.


Lowell Thomas


(*)Infinite strings and cyclical rules are not allowed. Left recursion is
not allowed but is easily removed with the ABNF repetition operator.


Post a followup to this message

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