zanzinge@immd2.informatik.uni-erlangen.de (M. Zanzinger) (01/22/91)
Hi there,
Does anyone know of a LEX/YACC definition for COBOL?
Please email and I will summarize if there's enough interest.
Any help would be greatly appreciated,
--
Michael Zanzinger, University of Erlangen/N"urnberg, Tel. 09131/ 85 79 36
email: zanzinge@immd2.informatik.uni-erlangen.de
[This question comes up every few months, most recently in May, August,
September, and November 1990. There has never been any response. I'll make
it an FAQ. Perhaps some of the people who want such a parser could get
together and write one -- it'd be large but not particularly difficult. -John]
--
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.thornley@uunet.UU.NET (David H. Thornley) (01/24/91)
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] -- Send compilers articles to compilers@iecc.cambridge.ma.us or {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.