Vilares Ferro, ManuelGraƱa Gil, Jorge2005-11-212005-11-211993Proceedings of the First Compulog Network Area Meeting on Parallelism and Implementation Technologies (COMPULOG-NOE-1993), Madrid (Spain)http://hdl.handle.net/2183/156[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.application/postscripttext/plainengContext-Free ParsingDynamic programmingHorn clausesEarley deductionDefinite clause programsLogical Push-Down AutomataParsing as resolutionjournal articleopen access