Parsing as resolution

UDC.coleccionInvestigaciónes_ES
UDC.departamentoCiencias da Computación e Tecnoloxías da Informaciónes_ES
dc.contributor.authorVilares Ferro, Manuel
dc.contributor.authorGraña Gil, Jorge
dc.date.accessioned2005-11-21T13:23:09Z
dc.date.available2005-11-21T13:23:09Z
dc.date.issued1993
dc.description.abstract[Abstract] A general context-free parsing algoritm based on logical dynamic programming techniques is described. The analyzer takes a general class of context-free grammar as drivers, and any finite string as input. In an empirical comparison, the new system appears to be superior to the others context-free analysers (as for example the SDF system), and comparable to the standard generators of deterministic parsers (as for example YACC, the standard generator of compilers in UNIX) when the input string is not ambiguous.es_ES
dc.format.mimetypeapplication/postscript
dc.format.mimetypetext/plain
dc.identifier.citationProceedings of the First Compulog Network Area Meeting on Parallelism and Implementation Technologies (COMPULOG-NOE-1993), Madrid (Spain)es_ES
dc.identifier.urihttp://hdl.handle.net/2183/156
dc.language.isoenges_ES
dc.rights.accessRightsopen accesses_ES
dc.subjectContext-Free Parsinges_ES
dc.subjectDynamic programminges_ES
dc.subjectHorn clauseses_ES
dc.subjectEarley deductiones_ES
dc.subjectDefinite clause programses_ES
dc.subjectLogical Push-Down Automataes_ES
dc.titleParsing as resolutiones_ES
dc.typejournal articlees_ES
dspace.entity.typePublication
relation.isAuthorOfPublication3d821e9c-de0b-47cc-a4e0-7c531569602e
relation.isAuthorOfPublication42896d75-4435-4f99-82e4-48a60a48d799
relation.isAuthorOfPublication.latestForDiscovery3d821e9c-de0b-47cc-a4e0-7c531569602e

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
GranaCOMPULOGNOE1993.ps
Size:
76.39 KB
Format:
Postscript Files