Author Topic: what is the current CC's parsing algorithm? LL? LR? LALR?  (Read 6270 times)

Offline ollydbg

  • Developer
  • Lives here!
  • *****
  • Posts: 5720
  • OpenCV and Robotics
    • Chinese OpenCV forum moderator
what is the current CC's parsing algorithm? LL? LR? LALR?
« on: April 14, 2010, 06:58:17 pm »
Today, I'm reading some books about compiler design. I have found that there are several types of parsers exist in the literature. Such as: top down parser, bottom up parser. or LL or LL(k) parser? or LR parser, or LALR parser?

So, can someone explain that which is the current CC's parser kind?
It seems the best fit one is: LALR(1) parser, but I'm not sure, because all these standard parser use a Pushdown automaton - Wikipedia, the free encyclopedia.

Thanks.
If some piece of memory should be reused, turn them to variables (or const variables).
If some piece of operations should be reused, turn them to functions.
If they happened together, then turn them to classes.