https://github.com/atlas-2192/language-algorithms

One of the first C++ projects I did, pretty much in a C style with C++ libs. Mostly for me to look back on to see how much i've improved.
https://github.com/atlas-2192/language-algorithms

Last synced: 4 days ago
JSON representation

One of the first C++ projects I did, pretty much in a C style with C++ libs. Mostly for me to look back on to see how much i've improved.

• Host: GitHub
• URL: https://github.com/atlas-2192/language-algorithms
• Owner: atlas-2192
• Created: 2024-11-26T22:54:59.000Z (about 1 month ago)
• Default Branch: master
• Last Pushed: 2024-11-26T23:00:49.000Z (about 1 month ago)
• Last Synced: 2024-11-29T11:23:37.483Z (about 1 month ago)
• Language: C++
• Size: 1010 KB
• Stars: 7
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Formal Langauge Algorithms

**Languages and Machines: An Introduction to the Theory of Computer Science (3rd Edition)** [Amazon](http://www.amazon.com/Languages-Machines-Introduction-Computer-Science/dp/0321322215)

Download, then navigate to the main folder by:

    cd ~/Formal-Language-Algorithms/Main

   

Then compile:

    make

Then to run:

    ./shell

The Help section in the from the shell program:

    :help - to display this

    :quit OR :q OR CTRL + D OR CRTL + C - to quit

    :ls  - to list the current files in dir

    :vim  - to edit a file using vim

    :cat  - displays a file

    ----------------------------------------

    These are all the algorithms, anything in  brackets are the arguments

    alg4_1  	 --remove recursive start symbol	-Page 105

    alg4_2  	 --remove lambda rules			-Page 108

    alg4_3   	 --remove chain rules			-Page 114

    alg4_4_2  	 --generate rules that derive terminals	-Page 117

    alg4_4_4  	 --remove un-reachable rules	        -Page 119

    alg4_5  	 --convert to Chomsky Normal Form	-Page 122

    alg4_6    --CYK algorithm			-Page 126    

    alg4_7  	--removable of direct left recursion	-Page 129

    alg4_8  	--convert to Greibach Normal Form	-Page 132

    alg5_6  		--remove non-determinism		-Page 172

    alg5_7  		--determine equivalent states		-Page 179

    alg6_2  	        --finite state to regular expression	-Page 194

Also there are some built in grammars and finite states in:

    

    ~/Formal-Language-Algorithms/Main/gram/

    ~/Formal-Language-Algorithms/Main/fa/