50% found this document useful (2 votes)
370 views1 page

NCS 653 Compiler Design Lab

This document outlines the implementation of various components of a compiler including lexical analyzers for if statements and arithmetic expressions, constructing NFAs and DFAs from regular expressions, parsing algorithms like shift-reduce and recursive descent, code optimization techniques, and code generation. The goal is to design a compiler through implementing these various phases like lexical analysis, parsing, optimization and code generation.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
50% found this document useful (2 votes)
370 views1 page

NCS 653 Compiler Design Lab

This document outlines the implementation of various components of a compiler including lexical analyzers for if statements and arithmetic expressions, constructing NFAs and DFAs from regular expressions, parsing algorithms like shift-reduce and recursive descent, code optimization techniques, and code generation. The goal is to design a compiler through implementing these various phases like lexical analysis, parsing, optimization and code generation.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

NCS 653 Compiler Design Lab

1. Implementation of LEXICAL ANALYZER for IF STATEMENT.


2. Implementation of LEXICAL ANALYZER for ARITHMETIC EXPRESSION.
3. Construction of NFA from REGULAR EXPRESSION.
4. Construction of DFA from NFA.
5. Implementation of SHIFT REDUCE PARSING ALGORITHM.
6. Implementation of OPERATOR PRECEDENCE PARSER.
7. Implementation of RECURSIVE DESCENT PARSER.
8. Implementation of CODE OPTIMIZATION TECHNIQUES.
9. Implementation of CODE GENERATOR.

You might also like