https://github.com/mateodaza/top-down-parser
Top-Down Parser Simulation on Java.
https://github.com/mateodaza/top-down-parser
compiler-design compilers java parser syntax-analysis
Last synced: 11 months ago
JSON representation
Top-Down Parser Simulation on Java.
- Host: GitHub
- URL: https://github.com/mateodaza/top-down-parser
- Owner: mateodaza
- Created: 2017-05-24T17:01:35.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-24T17:21:22.000Z (almost 9 years ago)
- Last Synced: 2025-02-16T22:43:46.953Z (about 1 year ago)
- Topics: compiler-design, compilers, java, parser, syntax-analysis
- Language: Java
- Homepage:
- Size: 49.8 KB
- Stars: 3
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Top-Down-Parser
Given a context-free grammar on a txt file, the app will remove left recursion and apply left factoring if needed.
Then based on FIRST and FOLLOW sets, it will generate a parse table which can be tested with some words examples.
You can test it with the exemple.txt file that's in the folder.
# Grammar Productions Syntax
- NonTerminals: UpperCase letters
- Terminals: Any symbol except for > or Uppercase letters
# Grammar File Example
```
E->E+T
E->T
T->T*F
T->F
F->i
F->(E)
```
# By the way
This was a Compilers class project and the UI is on Spanish. I hope its useful somehow!
## Author
**Mateo Daza** - [Universidad del Norte](http://www.uninorte.edu.co)
:)