Análisis sintáctico de sentencias incompletas

We describe a context-free parsing algorithm to deal with ill-formed input, including also unknown parts of unknown length. The parser produces a finite shared-forest compiling all parses, often infinite in number. In contrast to previous works, our proposal derives profite from a finer dynamic programming construction, resulting on an improved computational behavior. We also introduce a deductive construction based on the parsing schemata formalism, which is on the advantage of simplification on the description task.