Compiler Design VIVA Preparations
Hello all,
We are back to help you with the preparation of Viva of Compiler Design .Read it Well.
Practical 1
-https://goo.gl/jHKTWf
Practical 2
- https://goo.gl/1yqXs6
Practical 3
Practical 4
Aim: id+id*id | (id+id*(id)) parse this string and check whether its valid or not .
- https://goo.gl/X6d5Rr
Practical 5
- https://goo.gl/9w855e
Practical 6 (Python)
- https://goo.gl/t8DHuH
Practical 7
- https://goo.gl/Ry3kCm
All Practices Help
https://drive.google.com/open?id=0BwfFOvU_mRRWMHVrRzFWWGJxUzg
We are back to help you with the preparation of Viva of Compiler Design .Read it Well.
Practical 1
Aim:
Define basic ter minology related to
Compiler Design.
Practical 2
Aim: Write a program to implement symbol table.
Steps:
1) Take arithmetic expression “a + b
* c” as input.
2) Separate the symbols from given
expression.
3) Validate the identifier.
4)
If it is valid identifier than store into symbol table otherwise show an user
define error message.
Output:
Symbol
|
Type
of symbol
|
a
|
Identifier
|
+
|
Arithmetic
operator
|
Practical 3
Aim:
Write a program to validate the
expression with binary operator.
Steps:
1) Take arithmetic expression “a + b
* c” as input.
2) Validate the expression for binary operator.
- https://goo.gl/tKbVW7Practical 4
Aim: id+id*id | (id+id*(id)) parse this string and check whether its valid or not .
- https://goo.gl/X6d5Rr
Practical 5
Aim: Write a program to find out FIRST
() and FOLLOW() from given set of production rules.
Practical 6 (Python)
Aim: Write a program to eliminate Unit
production from given set of production.
Practical 7
Aim:Write a program
to implement calculator using lex and YACC.
All Practices Help
https://drive.google.com/open?id=0BwfFOvU_mRRWMHVrRzFWWGJxUzg
