Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Woo Hoo! Go C++ Go!
#31
This won't be too simple I think, but I sill won't to keep my hands off bison until I really need it Smile
Reply
#32
Quote:Well, that FLEX/BISON stuff was to make the tree construction easier. LR(1) automatas are great for this.

I though Flex/Bison made LALR(1) parsers by default. The great thing about using compiler tools like Flex and Bison is that they can catch lots of errors and tell when a grammar is ambiguous (not always easy to do), plus they make coding much simpler because all of the boring repetive work is done for you.

Quote:LooseCaboose: Interesting. Our compiler used a LR(1) authomata.
The compilers course I took this year was only a half semester (6 eeks) and focused largely on the theory, the parser project was mainly to get the hang of working with grammars in BNF format. I think the course I can take on compilers next year has a project for writting a complete compiler.

<offtopic uni stuff>
Only one exam left at uni now. Ive been doing some work with my version of Hosted MINIX recently and finally got the link process switched over from the Solaris linker to the GNU one. Hopefully Ill get a minimal kernel hosted on Linux soon.
</off topic uni stuff>
esus saves.... Passes to Moses, shoots, he scores!
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)