Convert Context-free grammar to CNF. X→ YaXb Y→aY|a X is start symbol If you are using any new variable for conversion then name of each variable symbol  should be first two alphabets of your name with roll number and then you can  increment value of roll number Example (Sh10, Sh11, Sh12)

Please written by computer source

expr term_tail term factor_tail id = expr | term term_tail + term term_tail | E factor factor_tail → * factor factor_tail | e factor → (expr) | id Explain why the grammar above is not LL(1). Be specific.

ompile the grammar to produce a lexer and parser. Note that you might need to do some formatting changes in your grammar file to successfully run the ANTLR program. Provide the details of the steps and commands you used to compile the grammar in your assignment submission report. Also, provide the snapshot of your terminal that shows the successful execution of your commands.   Test the lexer and parser generated using ANTLR’s inbuilt drivers and provide the snapshot of your terminal that shows the successful execution of your test commands.   Q3Write Test.java class to directly test the generated lexer and parser java files. Compile your java files and run the test program for both valid and invalid input

Parsing a small set of grammars is possible using a variety of approaches.

2. Convert the Grammar into Chomsky Normal Form and Greibach Normal Form X abT | bTa T aTb | b CNF: GNF:

Compiler design  Simple LR parsing Make LR(0) collection table and explanation with each step  Dont copy

Please help 8. The known Grammar as follows: S à AX X à or AX | ️ℇ A à CY Y à and CY | ️ℇ C à not C | (S) | 0 | 1 Question Please define the First Set and Follow Set

Please help 5. Please Perform Left Recursion Elimination for the following grammar:E à E + T | E – T | TT à TF | FF à F * | CC à a | b