Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72738
DC FieldValueLanguage
dc.contributor.authorFortes Gálvez, Joséen_US
dc.contributor.authorSchmitz, Sylvainen_US
dc.contributor.authorFarre, Jacquesen_US
dc.date.accessioned2020-05-22T10:53:32Z-
dc.date.available2020-05-22T10:53:32Z-
dc.date.issued2006en_US
dc.identifier.isbn3-540-37213-Xen_US
dc.identifier.issn0302-9743en_US
dc.identifier.otherWoS-
dc.identifier.urihttp://hdl.handle.net/10553/72738-
dc.description.abstractThis paper introduces a mechanism for combining unbounded lookahead exploration with linear time complexity in a deterministic parser. The idea is to use a resolve parsing action in place of the classical reduce. The construction of shift-resolve parsers is presented as a two-step algorithm, from the grammar to a finite nondeterministic automaton, and from this automaton to the deterministic parser. Grammar classes comparisons are provided.en_US
dc.languageengen_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.sourceImplementation And Application Of Automata [ISSN 0302-9743], v. 4094, p. 253-264, (2006)en_US
dc.subject1203 Ciencia de los ordenadoresen_US
dc.subject120323 Lenguajes de programaciónen_US
dc.subject.otherShift-resolveen_US
dc.subject.otherNoncanonical parseren_US
dc.subject.otherRegular lookaheaden_US
dc.subject.otherTwostack pushdown automatonen_US
dc.subject.otherPosition graphen_US
dc.titleShift-resolve parsing: simple, unbounded lookahead, linear timeen_US
dc.typeinfo:eu-repo/semantics/conferenceObjecten_US
dc.typeConference_Paperen_US
dc.relation.conference11th International Conference on Implementation and Application of Automata, CIAA 2006en_US
dc.identifier.doi10.1007/11812128_24en_US
dc.identifier.scopus33749392352-
dc.identifier.isi000240312700024-
dc.contributor.authorscopusid24283551700-
dc.contributor.authorscopusid14046096600-
dc.contributor.authorscopusid7005173865-
dc.identifier.eissn1611-3349-
dc.description.lastpage264en_US
dc.description.firstpage253en_US
dc.relation.volume4094en_US
dc.investigacionIngeniería y Arquitecturaen_US
dc.type2Actas de congresosen_US
dc.contributor.daisngid1904366-
dc.contributor.daisngid1540743-
dc.contributor.daisngid3279363-
dc.description.numberofpages12en_US
dc.utils.revisionen_US
dc.contributor.wosstandardWOS:Galvez, JF-
dc.contributor.wosstandardWOS:Schmitz, S-
dc.contributor.wosstandardWOS:Farre, J-
dc.date.coverdateEnero 2006en_US
dc.identifier.conferenceidevents120518-
item.grantfulltextopen-
item.fulltextCon texto completo-
crisitem.event.eventsstartdate21-08-2006-
crisitem.event.eventsenddate23-08-2006-
crisitem.author.deptDepartamento de Informática y Sistemas-
crisitem.author.fullNameFortes Gálvez, José-
crisitem.author.departamentoInformática y Sistemas-
Appears in Collections:Actas de congresos
Adobe PDF (212,51 kB)
Show simple item record

WEB OF SCIENCETM
Citations

5
checked on May 23, 2020

Page view(s)

15
checked on May 23, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.