> Of course everything is limited in some way, but the parser doesn't use the > token > stream as is, so it can in principle do any thing it wants between the lexing > stage and the parsing stage.
How do you think about implementation details like they are mentioned in the following information sources? 1. http://stackoverflow.com/questions/613479/where-can-i-find-standard-bnf-or-yacc-grammar-for-c-language 2. Paper "Parsing Non-LR(k) Grammars with Yacc" by Gary H. Merrill http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1958 3. Paper "A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages" by Adrian D. Thurston and James R. Cordy http://citeseerx.ksu.edu.sa/viewdoc/summary?doi=10.1.1.61.9431 4. Class library "Wave" http://www.boost.org/doc/libs/1_45_0/libs/wave/doc/preface.html Regards, Markus _______________________________________________ Cocci mailing list [email protected] http://lists.diku.dk/mailman/listinfo/cocci (Web access from inside DIKUs LAN only)
