| SL. No. | Particulars | Experiment Name |
| 1 | Computer | Design a lexical analyzer for given language and the lexical analyzer should ignore redundant spaces, tabs and new lines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value. Simulate the same in C language. |
| 2 | Computer | Write a C program to identify whether a given line is a comment or not. |
| 3 | Computer | Write a C program to recognize strings under ‘a’, ‘a*b+’, ‘abb’. |
| 4 | Computer | Write a C program to test whether a given identifier is valid or not. |
| 5 | Computer | Write a C program to simulate lexical analyzer for validating operators. |
| 6 | Computer | Implement the lexical analyzer using JLex, flex or other lexical analyzer generating tools. |
| 7 | Computer | Write a C program for implementing the functionalities of predictive parser for the mini language. |
| 8 | Computer | Write a C program for constructing of LL (1) parsing. |
| 9 | Computer | Write a C program for constructing recursive descent parsing. |
| 10 | Computer | Write a C program to implement LALR parsing. |