%0 Journal Article %1 Leo1991 %A Leo, Joop M. I. M. %D 1991 %J Theoretical Computer Science %K grammar %N 1 %P 165--176 %R 10.1016/0304-3975(91)90180-a %T A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead %U http://dx.doi.org/10.1016/0304-3975(91)90180-a %V 82

@article{Leo1991, added-at = {2020-05-24T20:36:48.000+0200}, author = {Leo, Joop M. I. M.}, biburl = {https://www.bibsonomy.org/bibtex/29e0284f402abb054df4ce12f58caa0c6/marcondg}, doi = {10.1016/0304-3975(91)90180-a}, interhash = {6a26051ee392bcf1da1306dc6d392dca}, intrahash = {9e0284f402abb054df4ce12f58caa0c6}, issn = {03043975}, journal = {Theoretical Computer Science}, keywords = {grammar}, month = may, number = 1, pages = {165--176}, timestamp = {2020-05-24T20:36:48.000+0200}, title = {{A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead}}, url = {http://dx.doi.org/10.1016/0304-3975(91)90180-a}, volume = 82, year = 1991 }