While I haven't gotten to read the code (or couldn't :) ) but it seems like it would be best to map these two a 2 diminsional array. Move the continuations up and attatch them. Then start at the begining and travel along. Maybe even build an OO representation of choices etc that then condenses down into your final BNF. Looks kinda like fun once you start thinking about it much. :)
In reply to Re: Parsing BNF syntax diagrams..
by eric256
in thread Parsing BNF syntax diagrams..
by castaway
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |