Please fill in the following blanks. The choices areidentifier.type, math.type, void, literal.type
Continue from last question: Last question, you generated an AST which is the output from the parser. Starting from this question, you will use this AST to do type checking (part of semantic analysis Please generate the type-rules based on given BNFs for expressions like: strA-“hello”+ world”(strA is a string typed variable) BNF: exp->identifiermath can generate RULE1 exp.types(if| Choose ▼-| Choose.. ▼then I choose.. ▼elseTYPEERRORİLEXP}
OR
OR