|Cobol grammar? email@example.com (2004-07-28)|
|Re: Cobol grammar? Ralf.Laemmel@cwi.nl (Ralf Laemmel) (2004-08-04)|
|From:||Ralf Laemmel <Ralf.Laemmel@cwi.nl>|
|Date:||4 Aug 2004 02:43:11 -0400|
|Posted-Date:||04 Aug 2004 02:43:11 EDT|
there are fuzzy parsers, robust parsers (based on island grammars),
tolerant parsers (based on skeleton grammars), and more.
Many pointers in http://homepages.cwi.nl/~ralf/ctp/
Having worked in this context, I would consider this still somewhat as
a black art. It is listed in some ways in the grammarware agenda (2nd
>I have to create a parser for Cobol AS/400. Because it's very
>difficult to find a complete grammar definition for this language, I
>wonder if there is a way for describing a grammar (BNF, EBNF,...) that
>tokenize only some specific rules and ignore all the rest.
Return to the
Search the comp.compilers archives again.