Cobol AS/400 hard

From: matteo (matteom_at_avanade.com)
Date: 07/23/04


Date: 23 Jul 2004 04:40:36 -0700

Hi all,
because it's very hard to find a complete grammar definition for Cobol
AS/400, I wonder if there is a way for describing a grammar (BNF,
EBNF,...) that tokenize only some specific rules and ignore all the
rest.
Many Thanks
Matteo.



Relevant Pages

  • Re: Another newbie design question
    ... Out of the idlest of curiousity, does this language have a BNF, ... or some other form of grammar definition? ...
    (comp.lang.python)
  • Re: Another newbie design question
    ... Out of the idlest of curiousity, does this language have a BNF, or ... some other form of grammar definition? ...
    (comp.lang.python)