From: Daryl Stewart (Daryl.Stewart@cl.cam.ac.uk)
Date: Thu Jul 20 2000 - 04:59:06 PDT
>
> Good morning Tom;
>
>
> About 9 years ago I saw a paper on a commercial tool that did this.
> I believe the syntax was closer to yacc though. Maybe that's a
> tool for Cadence to write :)
>
> There was one person who had tried to convert the BNF to a working
> grammar. He was unwilling to allow others to use it though.
>
> I had made a comment before that instead of BNF, we write in yacc -
> allowing checking of the grammar. I think that until we do something
> along these lines, the grammar described in the specification will
> always have these holes - no verification, no guarantees.
>
>
> Adam Krolnik
> Verification Mgr.
> LSI Logic Corp.
> Plano TX. 75074
There's a tool I used to produce lexers, parsers and pretty-printers from BNF
for a large subset of the October 95 draft syntax.
It's called CLaReT
http://www.dcs.gla.ac.uk/~boulton/claret/
and uses the Standard ML of New Jersey lex/yacc tools (although it's intended
to be targetable to other lex/yaccs).
If you want to see what the CLaReT "BNF" looks like see
http://www.cl.cam.ac.uk/users/djs1002/verilog.project/syntax/P1364.syn
I'd be willing to help if you think it looks interesting...
cheers
Daryl
This archive was generated by hypermail 2.1.4
: Mon Jul 08 2002 - 12:54:13 PDT
and
sponsored by Boyd Technology, Inc.