Definitions of necessary classes for working with contex-free grammars & an implementation of a few algorithms on them.
-
Updated
Jan 24, 2020 - C++
Definitions of necessary classes for working with contex-free grammars & an implementation of a few algorithms on them.
A Pushdown Automata that parses regular expressions
Finite & Pushdown Automata, Regular Grammar
Bioinformatics Data Structures & Algorithms [such as the Q-Gram Index, scoring alignments , rna-structure prediction, generating the BLAST-Ńeighborhood and more.]
C++14 Finite State Machine library
Add a description, image, and links to the pushdown-automata topic page so that developers can more easily learn about it.
To associate your repository with the pushdown-automata topic, visit your repo's landing page and select "manage topics."