Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Compiler books

Name: Anonymous 2009-11-14 14:56

I am currently reading through Engineering a Compiler because I heard that The Dragon Book is outdated and doesn't cover many things.  However, some sources tell me that The Dragon Book is still good even though it has aged.  What does /prog/ think?

I'm only in chapter 3 but finding it interesting so far, but I'm getting tired of the mathematical symbols used to describe everything without any clarification for someone who doesn't hasn't spent a good amount of time studying Set Theory.
In a regular grammar, however, productions in P are restricted to one of two forms: α→a, or α→aβ, where α, β ∈ NT and a ∈ T.
Gee, thanks.

Also, are there any other books on compiler design that are decent?

Name: Anonymous 2009-11-14 15:18

α→a
"α" implies "a."  Implying something is the same as "if α then a"

α→aβ
Same thing.  α implies the result of a AND β (boolean)

β ∈ NT
a ∈ T
∈ means that "a" is a member/element of set T
I forget this part.  Can you AND full sets? what does NT represent? an intersection?

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List