-
Notifications
You must be signed in to change notification settings - Fork 120
SS LAB
Abhishek Mali edited this page May 21, 2019
·
3 revisions
EXP NO | EXPERIMENT NAME | EXPERIMENT SOLUTION | OUTPUT |
---|---|---|---|
01. A | LEX - RECOGNIZE VALID ARITHMETIC EXPRESSION | LAB1.l | OUTPUT |
01. B | YACC - EVALUATE ARITHMETIC EXPRESSION |
LAB1B.l LAB1B.y |
OUTPUT |
02. | YACC - RECOGNIZE ALL STRINGS |
LAB2.l LAB2.y |
OUTPUT |
03. | C - CONSTRUCT PREDICTIVE/LL(1) PARSING TABLE | LAB3.c | OUTPUT |
04. | C - SHIFT REDUCE PARSING TECHNIQUE | LAB4.c | OUTPUT |
05. | C - GENERATE MACHINE CODE USING TRIPLES |
LAB5.c input.txt output.txt |
OUTPUT |
06. A | LEX - ELIMINATE COMMENT LINES IN A C PROGRAM |
LAB6.l f1.c f2.c |
OUTPUT |
06. B | YACC - RECOGNIZE VALID IDENTIFIER, OPERATORS AND KEYWORDS |
LAB6B.l LAB6B.y inputfile.c |
OUTPUT |
07. | C - ROUND ROBIN (RR) SCHEDULING ALGORITHM | LAB7.c | OUTPUT |
08. | C - BANKER’S ALGORITHM | LAB8.c | OUTPUT |
09. | C - PAGE REPLACEMENT ALGORITHMS LRU AND FIFO | LAB9.c | OUTPUT |
10. A | C - A NUMERICAL CALCULATOR | LAB10a.c | OUTPUT |
10. B | C - PAGE REPLACEMENT TECHNIQUE | LAB10b.c | OUTPUT |
11 | LEX - GIVEN SENTENCE IS SIMPLE OR COMPOUND | LAB11.l | OUTPUT |
12 | C++ EMULATE UNIX ln COMMAND | LAb12.cpp | OUTPUT |