Use this link to cite:

http://hdl.handle.net/2183/156

Parsing as resolution

Thumbnail Image

Files

GranaCOMPULOGNOE1993.ps (76.39 KB)

Identifiers

URI: http://hdl.handle.net/2183/156

Publication date

1993

Authors

Advisors

Other responsabilities

Journal Title

Bibliographic citation

Proceedings of the First Compulog Network Area Meeting on Parallelism and Implementation Technologies (COMPULOG-NOE-1993), Madrid (Spain)

Type of academic work

Academic degree

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.

Description

Keywords

Context-Free Parsing Dynamic programming Horn clauses Earley deduction Definite clause programs Logical Push-Down Automata

Editor version

Rights

Collections

Investigación (FIC)