Re: Cobol grammar?

Ralf Laemmel <Ralf.Laemmel@cwi.nl>
4 Aug 2004 02:43:11 -0400

          From comp.compilers
Related articles
Cobol grammar? matteom@avanade.com (2004-07-28)
Re: Cobol grammar? Ralf.Laemmel@cwi.nl (Ralf Laemmel) (2004-08-04)
| List of all articles for this month |
From: Ralf Laemmel <Ralf.Laemmel@cwi.nl>
Newsgroups: comp.compilers
Date: 4 Aug 2004 02:43:11 -0400
Organization: Compilers Central
References: 04-07-084
Keywords: Cobol, parse
Posted-Date: 04 Aug 2004 02:43:11 EDT

Hi Matteo,


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
edition): http://www.cs.vu.nl/grammarware/agenda/


Ralf




matteo wrote:


>Hi all,
>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.

Post a followup to this message

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