LL(1) grammar for boolean expression

Asked Nov 22 '16 at 21:00

Active Nov 22 '16 at 22:02

Viewed 545 times

I have a Boolean expression for example (var1 = 10 and var2 > 5) or var3 < 100.

I want to write an algorithm for syntax checking but I need to build the grammar first and then I need to construct a parse table.

Can anyone please give a clue on the grammar?

edited Nov 22 '16 at 22:02

BUCH

asked Nov 22 '16 at 21:00

deb

3

Have you made any attempt at a grammar yourself? – Captain Giraffe Nov 22 '16 at 21:02
Can you provide more examples of what sorts of expressions are permitted? – templatetypedef Nov 22 '16 at 21:04
one example of the expression would be (var1 = 100 or var2 => 5 ) and var3 < 5000 – deb Nov 22 '16 at 21:46
another example is var1 like 'ABC%' and VAR2 != 5 – deb Nov 22 '16 at 22:07
Are you just checking syntax, or do you need a parse tree? Also, does it have to be an LL(1) parser? – templatetypedef Nov 22 '16 at 22:17
yes , i just need to check syntax. that's all – deb Nov 22 '16 at 22:33
yes i am assembly language coder thus iterative method is preferable! – deb Nov 22 '16 at 22:34

0 Answers0