Help with Parser

[Koolrans]

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Thanks very much,

Koolrans

[Victor Bazarov]

Koolrans wrote:

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Chapter 6 in Stroustrup, if memory serves me, "Expressions", contains
a full example of an expression parser. Or you could get a book on
Lex and Yacc and use them.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[Noah Roberts]

Victor Bazarov wrote:

Koolrans wrote:

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Chapter 6 in Stroustrup, if memory serves me, "Expressions", contains
a full example of an expression parser. Or you could get a book on
Lex and Yacc and use them.

spirit being an alternative to lex and yacc.

[Koolrans]

Noah Roberts wrote:

Victor Bazarov wrote:

Koolrans wrote:

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Chapter 6 in Stroustrup, if memory serves me, "Expressions", contains
a full example of an expression parser. Or you could get a book on
Lex and Yacc and use them.

spirit being an alternative to lex and yacc.

Thanks you. That was helpful.

[Koolrans]

Victor Bazarov wrote:

Koolrans wrote:

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Chapter 6 in Stroustrup, if memory serves me, "Expressions", contains
a full example of an expression parser. Or you could get a book on
Lex and Yacc and use them.

V

Thanks for the input. I looked into that but looks like it is too heavy
for my purpose. Will definitely go over it in future if my need
increases.

Koolrans

[Koolrans]

Victor Bazarov wrote:

Koolrans wrote:

Greetings,

I have to write the following parser

{ (A) OR (B) OR (C) } {{ (E) AND (F) } OR { (E) OR (C) }}

Here each alphabet internally represents an integer. I am new to
parsing and do not have much idea. What would be the best approach to
this? Any pointers would be very helpful.

Chapter 6 in Stroustrup, if memory serves me, "Expressions", contains
a full example of an expression parser. Or you could get a book on
Lex and Yacc and use them.

Sorry, I meant Lex and Yacc were heavy for purpose. I was able to get
the examples for the book mentioned by you. They are very helpful.

koolrans