This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: • What do programming languages describe/express? • How many ways can programming langauges be implemented? • What is fundamentally different between compilation and interpretation? • What are the key characteristics of functional/imperative/object-oriented programming languages? • What are the fundamental principles of/requirements for compilers/translators? • How many different phases can a compiler be separated into? What does each phase do? • How many different phases can the compiler front-end be separated into? What does each phase do? • What is a regular expression? (recursively define it). What are they used for in compilers? • Give three example regular expressions. What do they describe? • What is a finite automata? What components does it have? • What is different between NFA and DFA? • How to convert from regular expression to NFA and then from NFA to DFA? • What is a context-free grammar? What is the language described by a CFG? • Give three example context-free grammars. What do they describe? What cannot be described by a CFG? • What is parsing? How to categorize different parsers? • What is a derivation? What is a parse tree? What is an abstract syntax tree? What are the differences? • When do we say a grammar is ambiguous? How to make it non-ambiguous? • What is a LL(K) parser? what is a LR(k) parser? Which is more powerful? • How to transform/prepare a grammar for top-down parsing? How to build a LL(1) parse table?...
View Full Document
This note was uploaded on 01/29/2012 for the course CS 5363 taught by Professor Staff during the Spring '08 term at The University of Texas at San Antonio- San Antonio.
- Spring '08