So I've been learning about stack machines, interpreters, compilers and a few other things related to programming languages and their general theory. Most of the stuff I find in books and online are very specialized and talk about one specific topic, e.g. interpreters, with no mention of how it relates to other topics, e.g. partial evaluators. Are there any good beginner resources for exploring the interconnections between interpreters, compilers, and partial evaluators? By good resources I mean something that explains the theory along with concrete implementations. The more I learn about this stuff the more places I see in my day to day work of how all of it can be applied but the lack of beginner friendly resources is a bit of bummer.
Theory of interpreters, partial evaluators, and compilers
318 Views Asked by David K. At
1
There are 1 best solutions below
Related Questions in COMPILER-CONSTRUCTION
- Is the compiler Xcode uses to produce Assembly code a bad compiler?
- How do compilers store hundreds of variables in only a few registers?
- Where to patch back the information gathered during program analysis
- Assignment Insertion in ROSE compiler after AssignOp
- memory layout of a multiple-inherited object in C++
- How to use my written compiler to read files on web?
- a LEX program to identify keywords and convert it into uppercase
- Identifier terminal except certain keywords
- Calling Scala compiler's AST from Java
- Computing the FOLLOW() set of a grammar
- JavaCC and Unicode issue. Why \u696d cannot be managed in JavaCC although it belong to the range "\u4e00"-"\u9fff"
- Three-address code and symbol tables
- Delegate caching behavior changes in Roslyn
- Get delimiter in Irony
- Compiler Errors including initializer before '<' token
Related Questions in INTERPRETER
- javascript nested loops waiting for user input
- Perl Command Line Interpreter crashing on exit
- Do JavaScript interpreters set all variables to undefined
- Parallel Interpreter For "Treehugger" Programming Language Not Functioning As Intended
- Eclipse, PyDev "Project interpreter not specified”
- Online Python interpreter? Internet explorer 8
- Why does the Lua interactive interpreter stop letting me type things in?
- How Scheme evaluates the man or boy test?
- Implementing reference counting in a stack-based approach in C
- Executing Parsed function calls in Haskell
- Handling recursion in scala's scheme interpreter
- MS Visual Studio-Python Environment-Adding an interpreter- "+ Custom..." greyed out
- Language lexing: better performance to lex a string all at once or individually?
- What is the difference between interpreter and mediator design pattern?
- Jint extremely slow with strings
Related Questions in COMPUTATION-THEORY
- Grammar for a^n
- Is there an algorithm for a compiler compiler that generates a recursive descent parser?
- Is $E_{LBA}$ a Turing recognizable language?
- The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable
- Knuth's bit reversal explanation
- How do I determine the big O for my nested for loop?
- Nullable nonterminals
- YACC: finding shift/reduce conflicts in a grammar
- Can this function be simplified (made more "fast")?
- how to intuitively think while Designing an NFA
- Assisstance with comparisons in primitive recursion
- Speeding up division and remainder when numerator is a multiple of power of two
- Is this a common pattern faced in Computer Science?
- Can abstract models for solving NP-hard problems be built in reality?
- How is Turing Machine which accepts nothing is not Recursively Enumerable?
Related Questions in COMPILER-THEORY
- Is performance of "less/greater than than" better than "less/greater than or equal to"
- Does evolution of microprocessors warrants evolution of compilers and language standards?
- What's the difference between parse trees and abstract syntax trees (ASTs)?
- Is there a way to compile C++ to C Code?
- Why are C and C++ different even after compilation?
- Is it possible to convert low level languages to high level ones?
- Identifying the next character in a string is capital or not
- Compiler Design: How do you distinguish between "op_Minus number" and "negativeNumber"?
- Programming Language Translation
- How to get the context-free grammar and its corresponding PDA ?
- How to construct parsing table for LL(k>1)?
- Compiler Optimization, Thread Safe?
- What language features are required in a programming language to make a compiler?
- Write a compiler for a language that looks ahead and multiple files?
- Pac-Man representation with Finite State Automaton
Related Questions in STACK-MACHINE
- How common is stack machine use in C++ code?
- Why jumping into an instruction even if containing a JUMPDEST does not work?
- Can a stack machine be implemented with `std::stack`?
- How does a register machine differ from a stack machine?
- Approximation of PI with Brouncker's formula using a Stack machine
- SSA for stack machine code
- Virtual machine design with separate stack and heap
- Theory of interpreters, partial evaluators, and compilers
- How do Stack Machines and 3AC Machines solve expressions?
- How to store variables from Symbol Table Compilers
- How to handle scope when generating bytecode with a handwritten compiler
- Assembly Stack machine: Exercise with Push/Pop
- Compiling switch statements for a simple VM
- Converting SSA to stack machine
- Does the processor use more than one stack to separate the call stack from the expression/register stack?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
one project which uses both interpreters, compiler, and partial evaluators is Truffle with Graal. you implement an AST interpreter in the Java Truffle framework and the JIT compiler Graal compiles it. the special thing about it is, that the Truffle language implementation should specialize to a subset of the actual semantics that correspond to the current execution. Graal only produces machine code for this specialized subset and deoptimizes, if previous execution assumptions are invalidated. the framework also inlines through all the AST execution methods, which is then a form of partial evaluation. you can find several papers online or directly have a look at the code.