Resumen

NIITSUMA, Hirotaka. Context-Free Grammars Including Left Recursion using Recursive miniKanren. Comp. y Sist. [online]. 2018, vol.22, n.4, pp.1395-1402.  Epub 10-Feb-2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-22-4-3072.

Recursive miniKanren is logic programming language which can deal infinite recursive data structure and a subset of the Scheme language. We define a pattern match macro which can use the same syntax of the match macro of the Scheme language using recursive miniKanren. The macro enables to write searching sub-list with a given pattern by only few line code. Using this property, we introduce techniques writing context-free grammar with our match macro. Unlike other specific paraphrasing tools, our technique can combine logical relations of miniKanren with a context-free grammar. We show the logical relations resolves the ambiguity of a grammar.

Palabras llave : Context-free grammars; left recursion; recursive miniKanren.

        · texto en Inglés     · Inglés ( pdf )