Question about parser/parsing technics

spy974@gmail.com
Tue, 6 Mar 2012 05:21:30 -0800 (PST)

          From comp.compilers
Related articles
Question about parser/parsing technics spy974@gmail.com (2012-03-06)
Re: Question about parser/parsing technics jkallup@web.de (Jens Kallup) (2012-03-06)
| List of all articles for this month |
From: spy974@gmail.com
Newsgroups: comp.compilers
Date: Tue, 6 Mar 2012 05:21:30 -0800 (PST)
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 06 Mar 2012 13:40:22 EST

Hi everyone,


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:
grammar:
- 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.


Post a followup to this message

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