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.]

Language: C++ - Size: 16.6 KB - Last synced at: over 1 year ago - Pushed at: over 3 years ago - Stars: 5 - Forks: 0

eriksonJAguiar/Livre-de-Contexto-TC-UENP

Language: JavaScript - Size: 519 KB - Last synced at: over 2 years ago - Pushed at: over 9 years ago - Stars: 0 - Forks: 0

LordAlucard90/Context-Free-Grammars-Normal-Formalizer

Given a Context-Free-Grammar the script will convert it into the selected Normal Form

Language: Python - Size: 21.5 KB - Last synced at: over 2 years ago - Pushed at: about 7 years ago - Stars: 10 - Forks: 6

behzadshomali/Pushdown_automaton

In the theory of computation, a pushdown automaton (PDA) is a type of automaton that employs a stack. In this program, a PDA is going to be constructed by the input grammar.

Language: Python - Size: 92.8 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 0 - Forks: 0