hycinth22 / ContextFreeGrammar-to-NPDA

[“形式语言与自动机”实验:给定任意上下文无关文法,将其转换为Greibach范式,再转换为NPDA,并能验证给定句子是否属于该文法。][Given an context-free grammar, convert it to Greibach paradigm, then to NPDA(i.e. Non-deterministic PushDown Automaton), and verify whether any sentence belongs to the grammar.]

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This repository is not active

About

[“形式语言与自动机”实验:给定任意上下文无关文法,将其转换为Greibach范式,再转换为NPDA,并能验证给定句子是否属于该文法。][Given an context-free grammar, convert it to Greibach paradigm, then to NPDA(i.e. Non-deterministic PushDown Automaton), and verify whether any sentence belongs to the grammar.]


Languages

Language:C++ 99.4%Language:CMake 0.6%