Inchworm Evaluation, Or Evaluating Prefix-Expressions with a Queue
The relation between stacks and expression evaluation is well established. Stack based evaluation is employed by every computer at some level. But what about the stacks brother, the queue? That last question is a thought thats been kicking around in my head for a while and everyonce in a while bubbles back up to the surface.
Search
Recent Posts
-
Data Structures For Representing Context Free Grammar
-
A B Tree of Binary Search Trees
-
Implementing enhanced for loops in Bytecode
-
Top-Down Deletion for Red/Black Trees
-
Function Closures For Bytecode VMs: Heap Allocated Activation Records & Access Links
-
Pascal & Bernoulli & Floyd: Triangles
-
A Quick tour of MGCLex
-
Compiling Regular Expressions for "The VM Approach"
-
Composable Linked Digraphs: An efficient NFA Data Structure for Thompsons Construction
-
Improving the Space Efficiency of Suffix Arrays
Meta
Leave A Comment