{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T20:27:54Z","timestamp":1693859274239},"reference-count":1,"publisher":"National Library of Serbia","issue":"2","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2011]]},"abstract":"<jats:p>Though yacc-like LR parser generators provide ways to solve shift-reduce\n   conflicts using token precedences, no mechanisms are provided for the\n   resolution of difficult shift-reduce or reduce-reduce conflicts. To solve\n   this kind of conflicts the language designer has to modify the grammar. All\n   the solutions for dealing with these difficult conflicts branch at each\n   alternative, leading to the exploration of the whole search tree. These\n   strategies differ in the way the tree is explored: GLR, Backtracking LR,\n   Backtracking LR with priorities, etc. This paper explores an entirely\n   different path: to extend the yacc conflict resolution sublanguage with new\n   constructs allowing the programmers to explicit the way the conflict must be\n   solved. These extensions supply ways to resolve any kind of conflicts,\n   including those that can not be solved using static precedences. The method\n   makes also feasible the parsing of grammars whose ambiguity must be solved in\n   terms of the semantic context. Besides, it brings to LR-parsing a common\n   LL-parsing feature: the advantage of providing full control over the specific\n   trees the user wants to build.<\/jats:p>","DOI":"10.2298\/csis101116008r","type":"journal-article","created":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T14:05:20Z","timestamp":1303394720000},"page":"517-531","source":"Crossref","is-referenced-by-count":2,"title":["Solving difficult LR parsing conflicts by postponing them"],"prefix":"10.2298","volume":"8","author":[{"given":"C.","family":"Rodriguez-Leon","sequence":"first","affiliation":[{"name":"Departamento de EIO y Computaci\u00f3n, Universidad de La Laguna"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Garcia-Forte","sequence":"additional","affiliation":[{"name":"Departamento de EIO y Computaci\u00f3n, Universidad de La Laguna"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230803"}],"container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:10Z","timestamp":1685349010000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141100008R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":1,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.2298\/csis101116008r","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}