Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #473

Question about parser/parsing technics

Show all headers | View raw

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.

Back to comp.compilers | Previous | Next — Next in thread | Find similar

Thread

Question about parser/parsing technics spy974@gmail.com - 2012-03-06 05:21 -0800
  Re: Question about parser/parsing technics Jens Kallup <jkallup@web.de> - 2012-03-06 19:52 +0100

csiph-web