The project was created for credit in the course Mathematical Linguistics in college. LL(1) syntactic analyzer that implements a generative dissection algorithm with a one symbol in advance for following grammar:
π β·= π ; π
π β·= ππβ
πβ β·= ππ | π
π β·= π | (π)
π β·= πΏπ β
π β² β·= . πΏ | π
πΏ β·= πΆπΏβ
πΏβ² β·= πΏ | π
πΆ β·= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
π β·= β | βΆ | + | β | Λ
Based on the above grammar, a reduced syntax diagram for the three main productions S, W and L was designed.
Examples of program execution:
Author: Cezary Bujak