|Parsing in Visual Basic firstname.lastname@example.org (Guillermo Phillips) (2003-05-15)|
|Re: Parsing in Visual Basic email@example.com (Guillermo Phillips) (2003-05-24)|
|Re: Parsing in Visual Basic firstname.lastname@example.org (Guillermo Phillips) (2003-05-29)|
|From:||"Guillermo Phillips" <email@example.com>|
|Date:||15 May 2003 12:30:49 -0400|
|Posted-Date:||15 May 2003 12:30:49 EDT|
In Visual Basic, I have written a compiler which takes BNF 'like'
definitions, which can then parse ASCII text streams and produce a resultant
parse tree. The parse tree is object oriented so can be accessed
recursively. I originally wrote it for analysing flight plan routes for
I just wonder how much interest there would be in something like this?
Here's a very short example of what a definition might look like (without
the VB code of course):
number := REPEAT IN '0' TO '9';
binary_op := AND expression, '+', expression;
bracketed_expression := AND '(', expression, ')';
expression:= OR binary_op, bracketed_expression, number;
For example this could be used as to parse expressions such as the
Return to the
Search the comp.compilers archives again.