Compiler design. Syntactic and semantic analysis
From MaRDI portal
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)
Recommendations
Cited in
(16)- Compiler construction. Theory, design, generation
- Incorporating static analysis in a combinator-based compiler
- Weighted tree automata with constraints
- A methodology and notation for compiler front end design
- scientific article; zbMATH DE number 194560 (Why is no real title available?)
- Compiler design. Virtual machines.
- On Tree Substitution Grammars
- Towards a theory of semantics and compilers for programming languages
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- scientific article; zbMATH DE number 3381836 (Why is no real title available?)
- Compiler design. Vol. 3: Analysis and transformation.
- Compiler design. Analysis and transformation.
- Solving the Weighted HOM-Problem With the Help of Unambiguity
- Improving dynamic code analysis by code abstraction
- The weighted HOM-problem over fields
- Weighted HOM-problem for nonnegative integers
This page was built for publication: Compiler design. Syntactic and semantic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894115)
