Related articles |
---|
Wanted: YACC grammar for COBOL zanzinge@immd2.informatik.uni-erlangen.de (1991-01-22) |
Re: Wanted: YACC grammar for COBOL plains!umn-cs!LOCAL!thornley@uunet.UU.NET (1991-01-24) |
Newsgroups: | comp.compilers,comp.lang.misc |
From: | plains!umn-cs!LOCAL!thornley@uunet.UU.NET (David H. Thornley) |
Keywords: | Cobol, parse, yacc, question |
Organization: | University of Minnesota, Minneapolis, CSci dept. |
References: | <1991Jan22.142741.6471@informatik.uni-erlangen.de> |
Date: | Thu, 24 Jan 91 01:33:19 GMT |
In article <1991Jan22.142741.6471@informatik.uni-erlangen.de> zanzinge@immd2.informatik.uni-erlangen.de (M. Zanzinger) writes:
>Does anyone know of a LEX/YACC definition for COBOL?
Can you do a LEX/YACC grammar for COBOL? I never tried it, but some
parts of it (like expressions) looked real weird to me. In other words,
is it LALR(0)?
Former COBOL hacker,
DHT
[I know of no particular reason why it'd be difficult to parse Cobol. It
doesn't look very ambiguous. On the other hand, I haven't actually tried
to write a parser for it. By the way, LALR is a large subset of LR(1), it
does look ahead a token. -John]
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.