Re: [fpc-pascal] BNF grammar for fpc

[Torsten Bonde Christiansen]

The reason is probably more because Wirthian languages traditionally use recursive descent parsers. gcc as well for several years simply because a recursive descent parser is faster than one generated automatically from a BNF grammar. That is true, but the _expression_ power is not as good as a BNF grammar. There are some language constructs that is simply not posible with a LL(1) parser, when comparing to the LALR(1). I don't have the details with me right now, but have a decent book on compiler construction at home. Kind regards, - Torsten Bonde Christiansen.

_______________________________________________
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal