This manual describes the system DyALog developped at the "Institut National de Recherche en Informatique et Automatisme" [INRIA] in France. DyALog is used to compile tabular executable from Logic Programs and Definite Clause Grammars. While working for standard Prolog-like programs programs, DyALog is essentially helpful to build efficient parsers for highly ambiguous and recursive grammars as found in Natural Language Processing.
Indeed, tabular executables keeps traces of sub-computations in a table in order to get computation sharing and loop detection. They also ensure computation completness and give the possibility to test different evaluation strategies.