04-19-2011, 07:43 PM
Question 1:
Draw the FA for a language which consists of the tokens:
<, <=, =, >=, >, <>, (,), +, -, *, /,:=, ;, identifier, keywords, constants
and literals (which are enclosed in apostrophes). Comments,
which begin with /* and end with a */, and blanks are ignored by the
scanner \9that is blanks are treated as blank separator only).
Question 2:
Design a context-free grammar which generates the mathematical
expressions for ‘+’ and ‘-’ operators. Also apply this grammar on
algebraic expression “a – b + c” and construct the parse tree for
this string
Plz any1 here to help me in this to on 19 its last date extent date. plz
Draw the FA for a language which consists of the tokens:
<, <=, =, >=, >, <>, (,), +, -, *, /,:=, ;, identifier, keywords, constants
and literals (which are enclosed in apostrophes). Comments,
which begin with /* and end with a */, and blanks are ignored by the
scanner \9that is blanks are treated as blank separator only).
Question 2:
Design a context-free grammar which generates the mathematical
expressions for ‘+’ and ‘-’ operators. Also apply this grammar on
algebraic expression “a – b + c” and construct the parse tree for
this string
Plz any1 here to help me in this to on 19 its last date extent date. plz