| Name |
Language |
Project |
Description |
| Bilal Ekrem Harmanşa |
JavaScript |
Recursive Descent Parser |
A step by step visualization guide for Recursive Descent Parser |
| Furkan Sarıhan |
JavaScript |
Deterministic Finite Automata |
Draws transition diagram for DFA with given transition table. |
| Yiğit Mert Dönmez |
JavaScript |
Push-Down Automata |
How yield notation and parse tree work according to given rules. |
| Emrah Tema |
JavaScript |
Regular Expressions |
This project includes general topics with examples about Regular Expressions and its patterns rules, and you can try out what you have learned instantly through with the program in the project. |
| Muhammet Ali Gülbahçe |
Java |
CF Grammar |
According to the rule selected by the user, the entered text must be checked accept or reject. |
| Selim Tural |
Java |
Deterministic Finite Automata |
This project about DFA. line-by-line code shows what they are doing. |
| Merve Özdemir |
Java |
Deterministic Finite Automata |
An application that demonstrates acceptance of an input with yield notations step by step for Deterministic Finite Automata. |
| Dila Erbakan |
Java |
Regular Expression to NFA |
Converting to DFA from Regular Expression. |
| Seda Çağlar |
Java |
Push-Down Automata |
Includes the push and pop operations in stack step by step for Push Down Automata. |
| Selin Daldaban |
Java |
NFA -> DFA Convertion |
Drawing and comparing dfa and nfa with Swing and examples. |
| Ümmügülsüm Can |
Java |
Nondeterministic FA |
Displaying accept or reject statuses of strings with jawa swing which are received from the user. |
| Ebrar Şahin |
JavaScript |
Deterministic FA |
Accept or reject the given string by using transition functions which are defined by users. |
| Ayşe Sena Feyiz |
Java |
Nondeterministic FA |
Shows step by step yield notation with java swing. |
| Betül Ezgü |
Java |
Push-Down Automata |
Stack aid, agree with the logic of the input of the PDA. |
| Enes Aydoğdu |
Java |
MicroJ IDE |
The code is checked for each input. If the code is incorrect, the user is warned. If the code is correct, the result is printed on the screen. |
| Saide Başpehlivan |
Java |
Deterministic FA |
Accepting or rejecting string written according to dfa conversion table. |
| Abdurrahman Rajab |
JavaScript |
Turing Machine |
Turing machine step by step simulation for n 1 n | n ≥ 1}. |
| Ahmet Fırat Şüphesiz |
Java |
CF Grammar |
Context-Free Grammer explicated with examples via Derivation Trees and defined meaning of Ambiguous. |
| Bedirhan Yıldırım |
JavaScript |
Regular Expressions |
Regular Expression examples on HTML inputs. |
| Tolga Tezel |
Java |
Pattern Searcher and Questions |
The patterns given by the user will be searched in the text, and if there is a match, matching parts will be enclosed in quotation marks. And There will be questions about regex and answers of those questions. |
| Burak Uğuz |
JavaScript |
Regular Expressions |
The text is checked according to the user's regular expression and matchses are showed in green color. |
| Enes Kamil Yılmaz |
Java |
NFA -> DFA Convertion |
This project will show how to convert NFA to DFA step by step through the examples given. |
| Salim Şahin |
Java |
Javadocs of Automata |
Javadoc websites of MAEyler's examples. |
