|Question about parser/parsing technics email@example.com (2012-03-06)|
|Re: Question about parser/parsing technics firstname.lastname@example.org (Jens Kallup) (2012-03-06)|
|Date:||Tue, 6 Mar 2012 05:21:30 -0800 (PST)|
|Posted-Date:||06 Mar 2012 13:40:22 EST|
I was wondering if it exists a parser (fault tolerant) which can create an (maybe) incomplete concrete syntax tree according to an incomplete grammar ?
Create only parts of the tree that it recognizes, and the rest are inside a token 'unknown' (or something else).
informal & light example:
- root -> Add
- Add -> Int + Int
- Int -> [0..9]+
for expression: "1 + 41" it will create a complete tree
for expression: "1 + 3.14" it create a tree where the right operand of Add is (or tagged as) unrecognized.
thanks for pointers you will give me.
Return to the
Search the comp.compilers archives again.