Useful Links
Computer Science
Programming
Programming Language Theory
1. Introduction to Programming Language Theory
2. Mathematical Foundations
3. Lambda Calculus
4. Syntax and Parsing
5. Formal Semantics
6. Type Systems
7. Programming Language Features
8. Implementation Strategies
9. Advanced Topics
Implementation Strategies
Interpretation
Tree-Walking Interpreters
AST Traversal
Environment Management
Direct Execution
Bytecode Interpretation
Virtual Machine Design
Instruction Sets
Stack-Based Execution
Compilation Approaches
Compiler Architecture
Multi-Pass Compilation
Single-Pass Compilation
Incremental Compilation
Frontend Processing
Lexical Analysis
Syntax Analysis
Semantic Analysis
Symbol Tables
Intermediate Representations
High-Level IR
Low-Level IR
Control Flow Graphs
Static Single Assignment
Optimization Techniques
Local Optimizations
Constant Folding
Algebraic Simplification
Dead Code Elimination
Global Optimizations
Common Subexpression Elimination
Loop Optimizations
Inlining
Code Generation
Instruction Selection
Register Allocation
Instruction Scheduling
Memory Management
Stack Allocation
Activation Records
Call Stack Management
Stack Overflow
Heap Allocation
Dynamic Memory Allocation
Heap Organization
Fragmentation
Garbage Collection
Reference Counting
Cycle Detection
Weak References
Tracing Collectors
Mark-and-Sweep
Copying Collection
Mark-Compact
Generational Collection
Generational Hypothesis
Nursery Collection
Promotion Policies
Previous
7. Programming Language Features
Go to top
Next
9. Advanced Topics