|
Size: 112
Comment:
|
← Revision 3 as of 2005-08-25 17:17:55 ⇥
Size: 539
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 5: | Line 5: |
Basically this lecture is a high level over view of Regular languages in the context of scanning/lexing etc. We discussed DFAs, NFAs & RE and the RE --> NFA construction. Subset construction algorithm: Translates NFA --> DFA. The symbol table is to organize the variables so that when I recognize a variable you can return a location in the symbol table instead of the value. This abstracts the value from the token. |
attachment:HPrograms_eclipse_compiler-slides_02-scanning.4.pdf
p18 " " space is concatenation operator.
Basically this lecture is a high level over view of Regular languages in the context of scanning/lexing etc. We discussed DFAs, NFAs & RE and the RE --> NFA construction.
Subset construction algorithm: Translates NFA --> DFA.
The symbol table is to organize the variables so that when I recognize a variable you can return a location in the symbol table instead of the value. This abstracts the value from the token.