Skip to content

mameaw14/ll1-parser

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

ll1-parser

An assignment in Theory of Computation subject

Do a parser for a languange generated by grammars

Alphabets

a-z, A-Z, 0-9, +-*/.()=$

Grammars

  1. S -> ZS | ε
  2. Z -> id = E;
  3. E -> TE’
  4. E’ -> +TE’ | -TE’ | ε
  5. T -> FT’
  6. T’ -> *FT’ | /FT’ | ε
  7. F -> idA | int | real | (E)
  8. A -> (E) | ε

About

An assignment in Theory of Computation subject

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages