Author:
Farré Jacques,Gálvez José Fortes
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lect Notes Comput Sci;J. Aycock,1999
2. T. P. Baker. Extending look-ahead for LR parsers. J. Comput. Syst. Sci., 22(2):243–259, 1981.
3. M. E. Bermudez and K. M. Schimpf. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230–250, 1990.
4. P. Boullier. Contribution-a la construction automatique d’analyseurs lexicographiques et syntaxiques. PhD thesis, Université d’Orléans, France, 1984. In French.
5. K. Čulik II and R. Cohen. LR-regular grammars — an extension of LR(k) grammars. J. Comput. Syst. Sci., 7:66–96, 1973.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DFA with a Bounded Activity Level;Language and Automata Theory and Applications;2014
2. On LR Parsing with Selective Delays;Lecture Notes in Computer Science;2013
3. A predictive bottom-up parser;Computing;2010-11-26
4. Left-to-right regular languages and two-way restarting automata;RAIRO - Theoretical Informatics and Applications;2009-04-24
5. Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time;Implementation and Application of Automata;2006