Skip to main content

ktu 2019 Cse Complier programing Lab Syllabus

 1Design and implement a lexical analyzer using C language to recognize all valid tokens

 in the input program. The lexical analyzer should ignore redundant spaces, tabs and

 newlines. It should also ignore comments.

2. Implement a Lexical Analyzer for a given program using Lex Tool.

3. Write a lex program to display the number of lines, words and characters in an input text.

4. Write a LEX Program to convert the substring abc to ABC from the given input string.

5. Write a lex program to find out the total number of vowels and consonants from the given input string.

6. Generate a YACC specification to recognize a valid arithmetic expression that uses operators +, – , *,/ and parenthesis.

7. Generate a YACC specification to recognize a valid identifier which starts with a letter

 followed by any number of letters or digits. 

 8. Implementation of Calculator using LEX and YACC

 9. Convert the BNF rules into YACC form and write code to generate abstract

 syntax tree.

 10. Write a program to find ε – closure of all states of any given NFA with ε transition.

 11. Write a program to convert NFA with ε transition to NFA without ε transition.

 12. Write a program to convert NFA to DFA.

 13. Write a program to minimize any given DFA.

 14. Write a program to find the First and Follow of any given grammar.

 15. Design and implement a recursive descent parser for a given grammar.

 16. Construct a Shift Reduce Parser for a given language.

 17. Write a program to perform constant propagation.

 18. Implement Intermediate code generation for simple expressions.

 19. Implement the back end of the compiler which takes the three address code and

 produces the 8086 assembly language instructions that can be assembled and run

 using an 8086 assembler. The target assembly instructions can be simple move, Add, sub, jump etc... 


Labels:

Comments

Post a Comment

Popular posts from this blog

Program 6: Finding Prime Numbers in a Range

  ** Program 6: Finding Prime Numbers in a Range ** ```assembly .model small .stack 100h .data     start dw 1     end dw 20 .code     main proc         mov ax, start           ; Load 'start' into AX              find_primes:         inc ax                  ; Move to the next number         cmp ax, end             ; Compare with 'end'         jg end_prog             ; Jump to end if AX > 'end'                  mov cx, ax              ; Copy AX to CX   ...
Post a Comment
Read more

4. Write a LEX Program to convert the substring abc to ABC from the given input string.

Sure, here's a LEX program that converts the substring "abc" to "ABC" in the given input string: ```lex %{ #include <stdio.h> %} %% .*abc.*    { printf("%s", yytext); }    /* Match and print everything containing 'abc' */ .         ;                            /* Ignore other characters */ %% int main() {     yylex();     return 0; } ``` Now, let's break down the code line by line: 1. `%{` and `%}`: These are used to enclose C code that should be included in the generated C code. In this case, it includes the standard input-output library (`<stdio.h>`). 2. `.*abc.*`: This is a regular expression pattern. It matches any sequence of characters that contains the substring "abc". 3. `{ printf("%s", yytext); }`: This is the action associated with the pattern. When the pattern is matched, the `yytext` variable contains the matched te...
Post a Comment
Read more