Parsing as resolution
| UDC.coleccion | Investigación | es_ES |
| UDC.departamento | Ciencias da Computación e Tecnoloxías da Información | es_ES |
| dc.contributor.author | Vilares Ferro, Manuel | |
| dc.contributor.author | Graña Gil, Jorge | |
| dc.date.accessioned | 2005-11-21T13:23:09Z | |
| dc.date.available | 2005-11-21T13:23:09Z | |
| dc.date.issued | 1993 | |
| 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.mimetype | application/postscript | |
| dc.format.mimetype | text/plain | |
| dc.identifier.citation | Proceedings of the First Compulog Network Area Meeting on Parallelism and Implementation Technologies (COMPULOG-NOE-1993), Madrid (Spain) | es_ES |
| dc.identifier.uri | http://hdl.handle.net/2183/156 | |
| dc.language.iso | eng | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.subject | Context-Free Parsing | es_ES |
| dc.subject | Dynamic programming | es_ES |
| dc.subject | Horn clauses | es_ES |
| dc.subject | Earley deduction | es_ES |
| dc.subject | Definite clause programs | es_ES |
| dc.subject | Logical Push-Down Automata | es_ES |
| dc.title | Parsing as resolution | es_ES |
| dc.type | journal article | es_ES |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 3d821e9c-de0b-47cc-a4e0-7c531569602e | |
| relation.isAuthorOfPublication | 42896d75-4435-4f99-82e4-48a60a48d799 | |
| relation.isAuthorOfPublication.latestForDiscovery | 3d821e9c-de0b-47cc-a4e0-7c531569602e |
Files
Original bundle
1 - 1 of 1

