> That may be because it is no longer possible to write a BNF grammar for > these compilers due to the c-style extensions.
AFAIK if a parser can be made for an extension, so is the grammar. > There are some language constructs that is simply not posible with a LL(1) > parser, > when comparing to the LALR(1). For example, left recursion. Yes, I know LALR(1) can recognize this. But it can be solved easily by transforming the grammar such that the recursion is eliminated and LL(1) wins again. -- View this message in context: http://www.nabble.com/BNF-grammar-for-fpc-tp25914637p25952532.html Sent from the Free Pascal - General mailing list archive at Nabble.com. _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
