Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference13 articles.
1. Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Reading, MA.: Addison-Wesley 1977
2. DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14(7), 453?460 (1971)
3. DeRemer, F.L., Pennello, T.J.: Efficient computation of LALR(1) lookahead sets. Proceedings of the ACM Sigplan conference on compiler construction, Sigplan Notices 8, 176?187 (1979)
4. DeRemer, F.L., Pennello, T.J.: Efficient computation of LALR(1) lookahead sets, ACM Toplas 4, 615?649 (1982)
5. Eve, J., Kurki-Suono, R.: On computing the transitive closure of a relation. Acta Informatica 8, 303?314 (1977)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast deterministic parsers for transition networks;Acta Informatica;2017-11-04
2. Shift-Reduce Parsers for Transition Networks;Language and Automata Theory and Applications;2014
3. Towards a Taxonomy for ECFG and RRPG Parsing;Language and Automata Theory and Applications;2009
4. Macros for context-free grammars;Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming;2008-07-15
5. Yet another generation of LALR parsers for regular right part grammars;Acta Informatica;2001-06