KTU Compiler Design Lab Programs
- Design and implement a lexical analyzer for given language using C and the lexical analyzer should ignore reduntant sapces, tabsa and new-lines.
- Implement the above lexical analyzer using a LEX tool.
- Generate YACC specifaiction for a few syntactic categories: (a). Pgm to recognize a valid arithmetic epression that uses operator +,-,* and / (b). Pgm to recognzie a valid variable which stands with a letter followed by any no. of letters or digits. (c). Implementation of calculator using LEX and YACC. (d). Convert the BNF rules into YACC form and writre code to generate abstract syntax tree.
- Write a Pgm to conert NFA to DFA.
- Write a Pgm to minimize any given DFA.
- Develop an operator precedence parser for a given language.
- Write program to find simulate first and follow of any given grammar.
- Construct a recursive decent parser for an expression.
- Construct a shift reduce parser for a given language.
- Write a Pgm to perform loop unrolling.
- Write a Pgm to perform contant propogation. x ----------------- E N D ----------------- x