Lr PARser TABLE C/c++ code

[pradyot]

can anyone give me "LR PARSER" TABLE C\C++ Code please.........................................

[MrA]

Sounds like homework. If it's not homework, then you're probably looking for a parser generator library, in which case you should look at ANTLR or Bison. There's also one in Boost. If your grammar is LL(k), then you could always write a recursive decent parser by hand, which isn't very hard.

[pradyot]

  MrA said:

Sounds like homework. If it's not homework, then you're probably looking for a parser generator library, in which case you should look at ANTLR or Bison. There's also one in Boost. If your grammar is LL(k), then you could always write a recursive decent parser by hand, which isn't very hard.

I cannot get You Please Tell me In Detail !!

[Argote]

Do you mean you need a state transition table for a recursive parser?

[pradyot]

  Argote said:

Do you mean you need a state transition table for a recursive parser?

Yeah DAt Might Do ,,,plsss

[Argote]

Well for that you need to build it yourself since those tables are unique to each grammar. You first need to make sure there are no ambiguities in you grammar, then create the states and transitions for each based on your grammar in a state diagram and then create the table based on that (creating the table is the easy part).