|
| From: | Derek M Jones |
| Subject: | Re: How to construct a BNF for a language mechanically and incrementally? |
| Date: | Wed, 30 Dec 2009 11:52:43 +0000 |
| User-agent: | Thunderbird 2.0.0.23 (Windows/20090812) |
Peng Yu,
Why Bison/Flex are not good at Fortran? What is special for Fortran's grammar?
Parsing Fortran is not that hard it is the lexical analysis that is very fiddly. Read about my recent attempts here: shape-of-code.coding-guidelines.com/2009/12/parsing-fortran-95 -- Derek M. Jones tel: +44 (0) 1252 520 667 Knowledge Software Ltd mailto:address@hidden Source code analysis http://www.knosof.co.uk
| [Prev in Thread] | Current Thread | [Next in Thread] |