Context-Free Grammars including Left Recursion using Recursive miniKanren

Hirotaka Niitsuma

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)1395-1402
Number of pages8
JournalComputacion y Sistemas
Volume22
Issue number4
DOIs
Publication statusPublished - Jan 1 2018

Keywords

  • Context-free grammars
  • Left recursion
  • Recursive miniKanren

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Context-Free Grammars including Left Recursion using Recursive miniKanren'. Together they form a unique fingerprint.

  • Cite this