@inproceedings{nederhof-sarbo-1993-increasing,
    title = "Increasing the Applicability of {LR} Parsing",
    author = "Nederhof, Mark-Jan  and
      Sarbo, Janos J.",
    editor = "Bunt, Harry  and
      Berwick, Robert  and
      Church, Ken  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Nagao, Makoto  and
      Nijholt, Anton  and
      Steedman, Mark  and
      Thompson, Henry  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Wilks, Yorick  and
      Wittenburg, Kent",
    booktitle = "Proceedings of the Third International Workshop on Parsing Technologies",
    month = aug # " 10-13",
    year = "1993",
    address = "Tilburg, Netherlands and Durbuy, Belgium",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/1993.iwpt-1.16/",
    pages = "187--202",
    abstract = "In this paper we describe a phenomenon present in some context-free grammars, called \textit{hidden left recursion}. We show that ordinary LR parsing according to hidden left-recursive grammars is not possible and we indicate a range of solutions to this problem. One of these solutions is a new parsing technique, which is a variant of traditional LR parsing. This new parsing technique can be used both with and without lookahead and the nondeterminism can be realized using backtracking or using a graph-structured stack."
}