A language L is a subset of Pascal with the following constructs:
a). Expressions involving the operators ‘+’ and ‘<‘ only
b). Assignment statements
c). ‘while’ statements and
d). Compound statements with the syntax ‘begin…………..end’
Give an unambiguous grammar for L.
