Re^3: Parse:RecDescent grammar help

Paul,

Thank-you for the reply...I will try these changes out after Jury Duty :-(

From the examples yourself and tachyon provided, I realize that the output of what's parsed can become very complex and get nasty real quick. Perhaps I'll need to set some limitations on how many nested statments are allowed...otherwise retreiving this data is going to be a nightmare.

Thanks again!

-Phillip

Comment on Re^3: Parse:RecDescent grammar help

Replies are listed 'Best First'.
Re^4: Parse:RecDescent grammar help by thekestrel (Friar) on Oct 27, 2004 at 03:49 UTC
Phillip, Limiting the rules.....Hmm I'm not sure how you do that. Once you make it recursive you can just keep on embedding and it will parse to its hearts content. Which then kinda puts the onus on have a smart system to traverse sed data. One the top level of the tree it would be a trivial task to search upper nodes for ones of say type 'array' then search that list for the presence of the correct one. I'm kinda enjoying this actually, because now I'm a lot more equipped to play with some of my rules after tinkering with this. Regards Paul	[reply]

Replies are listed 'Best First'.

Re^4: Parse:RecDescent grammar help
by thekestrel (Friar) on Oct 27, 2004 at 03:49 UTC

Limiting the rules.....Hmm I'm not sure how you do that. Once you make it recursive you can just keep on embedding and it will parse to its hearts content.
Which then kinda puts the onus on have a smart system to traverse sed data. One the top level of the tree it would be a trivial task to search upper nodes for ones of say type 'array' then search that list for the presence of the correct one.
I'm kinda enjoying this actually, because now I'm a lot more equipped to play with some of my rules after tinkering with this.

[reply]