Course:Compiler Design 1.a) Write a grammar for parsing the string a=b/ (c-d)*(x+y).b) Now perform a Left-most derivation for the string.c) Draw a parse tree for the string.d) Is the grammar ambiguous? Motivate your answer.2.Use the grammar you have created in Question 1 for an infix expression altechnique: Syntax Directed Definition write appropriate semantic rules to convert an injixexpression of that grammar to a prefix expression.Precedence of operators are given below (high to low):()*, /+,Associativity of operators are given below:+, -, *, /[Left Associative][Right Associative]%3DTaking into account the precedence and the associativity of the operators in this question,if any modification is needed for your grammar in Question 1 to be used in this question,do it. After the necessary modification(s),a) write the semantic rules for infix to prefix conversionb) draw the annotated parse tree for the string: a=Db/(c-d)*(x+y)

Name: Course:Compiler Design 1.a) Write a grammar for parsing the string a=b
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Course:Compiler Design 1.a) Write a grammar for parsing the string a=b/ (c-d)*(x+y).b) Now perform a Left-most derivation for the string.c) Draw a parse tree for the string.d) Is the grammar ambiguous? Motivate your answer.2.Use the grammar you have