Consider a CFL for Java if-statements: G = ({, , }, {if, condition, else, (, ), stmt}, R, ) where R is: → stmt | | → if ( condition ) → if ( condition ) else Show that G is ambiguous and give a different, unambiguous grammar for the same language that corresponds to Java semantics.

De Morgan’s laws state that specific Boolean statements can be written in different ways with the same meaning. A group of negated ANDs is the same as a negated group of ORs (!a && !b && !c) === !(a || b || c) A group of negated ORs is the same as a negated group of ANDs (!a || !b || !c) === !(a && b && c)   Which construction would you use if your programming code needed to check if at least one of a,b,c is true? Which construction would you use if your programming code needed to check that a,b,c are all true? Explain your reasoning about choosing the programming code.

26. Which is the correct statement(s) for Non Recursive predictive parser?S1: First(α) = {t | α => * t β for some string β } => *tβS2: Follow(X) = { a | S => * αXa β for some strings α and β } a. Both statements S1 and S2 are incorrect b. S1 is incorrect and S2 is correct c. S1 is correct and S2 is incorrect d. Both statements S1 and S2 are correct