M. Ancona, G. Dodero, V. Gianuzzi, and M. Morgavi, Efficient construction of LR(k) states and tables, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.150-178, 1991.
DOI : 10.1145/114005.102809

H. J. Basten, The Usability of Ambiguity Detection Methods for Context-Free Grammars, LDTA'08 , 8th Workshop on Language Descriptions, Tools and Applications, pp.35-46, 2008.
DOI : 10.1016/j.entcs.2009.09.039

M. E. Bermudez and K. M. Schimpf, Practical arbitrary lookahead LR parsing, Journal of Computer and System Sciences, vol.41, issue.2, pp.230-250, 1990.
DOI : 10.1016/0022-0000(90)90037-L
URL : http://doi.org/10.1016/0022-0000(90)90037-l

E. Bertsch and M. J. Nederhof, Some observations on LR-like parsing with delayed reduction, Information Processing Letters, vol.104, issue.6, pp.195-199, 2007.
DOI : 10.1016/j.ipl.2007.07.003

P. Boullier, ContributionàContribution`Contributionà la construction automatique d'analyseurs lexicographiques et syntaxiques, Thèse d' ´ Etat, 1984.

?. Culik, K. Cohen, and R. , LR-regular grammars???an extension of LR(k) grammars, Journal of Computer and System Sciences, vol.7, issue.1, pp.66-96, 1973.
DOI : 10.1016/S0022-0000(73)80050-9

A. J. Demers, Generalized left corner parsing, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.170-182, 1977.
DOI : 10.1145/512950.512966

J. Farré, F. Gálvez, and J. , A Bounded Graph-Connect Construction for LR-regular Parsers, 10th International Conference on Compiler Construction, pp.244-258, 2001.
DOI : 10.1007/3-540-45306-7_17

F. Gálvez, J. Schmitz, S. Farré, and J. , Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time, CIAA'06 , 11th International Conference on Implementation and Application of Automata, pp.253-26410, 1007.
DOI : 10.1007/11812128_24

J. Gosling, B. Joy, and G. Steele, The Java TM Language Specification, 1996.

L. C. Kats, E. Visser, and G. Wachsmuth, Pure and declarative syntax definition: Paradise lost and regained, OOPSLA 2010 , ACM international conference on Object oriented programming systems languages and applications, pp.918-932, 2010.

D. E. Knuth, On the translation of languages from left to right, Information and Control, vol.8, issue.6, pp.607-63910, 1965.
DOI : 10.1016/S0019-9958(65)90426-2

R. Leermakers, Recursive ascent parsing: from Earley to Marcus, Theoretical Computer Science, vol.104, issue.2, pp.299-312, 1992.
DOI : 10.1016/0304-3975(92)90127-2

B. A. Malloy, J. F. Power, and J. T. Waldron, Applying software engineering techniques to parser design: the development of a C# parser, SAICSIT'02, pp.75-82, 2002.

M. P. Marcus, A Theory of Syntactic Recognition for Natural Language. Series in Artificial Intelligence, 1980.

S. Mcpeak and G. C. Necula, Elkhound: A Fast, Practical GLR Parser Generator, 13th International Conference on Compiler Construction, pp.73-8810, 2004.
DOI : 10.1007/978-3-540-24723-4_6

M. D. Mickunas, R. L. Lancaster, and V. B. Schneider, Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars, Journal of the ACM, vol.23, issue.3, pp.511-533, 1976.
DOI : 10.1145/321958.321972

A. Nijholt, Context-free grammars: Covers, normal forms, and parsing, LNCS, vol.93, 1980.
DOI : 10.1007/3-540-10245-0

T. J. Parr and R. W. Quong, >1 lookahead, ACM SIGPLAN Notices, vol.31, issue.2, pp.27-34, 1996.
DOI : 10.1145/226060.226066

J. Reeder, P. Steffen, and R. Giegerich, Effective ambiguity checking in biosequence analysis, BMC Bioinformatics, vol.6, issue.1, pp.153-163, 2005.
DOI : 10.1186/1471-2105-6-153

S. Schmitz, An experimental ambiguity detection tool, Science of Computer Programming, vol.75, issue.1-2, pp.71-84, 2010.
DOI : 10.1016/j.scico.2009.07.002
URL : https://hal.archives-ouvertes.fr/hal-00436398

S. Sippu and E. Soisalon-soininen, Parsing Theory LR(k) and LL(k) Parsing, EATCS Monographs on Theoretical Computer Science, vol.20, 1990.

E. Soisalon-soininen and E. Ukkonen, A method for transforming grammars into LL(k) form, Acta Informatica, vol.12, issue.1, pp.339-369, 1979.
DOI : 10.1007/BF00268320

T. G. Szymanski and J. H. Williams, Noncanonical Extensions of Bottom-Up Parsing Techniques, SIAM Journal on Computing, vol.5, issue.2, pp.231-250, 1976.
DOI : 10.1137/0205019

K. C. Tai, Noncanonical SLR(1) Grammars, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.295-320, 1979.
DOI : 10.1145/357073.357083