TY  - JOUR
AU  - Patra, Sambit Kumar 
AU  - Pattanayak, Binod Kumar 
AU  - Puthal, Bhagabat 
PY  - 2013
TI  - Javascript Interpreter Using Non Recursive Abstract Syntax Tree Based Stack
JF  - American Journal of Applied Sciences
VL  - 10
IS  - 4
DO  - 10.3844/ajassp.2013.403.413
UR  - https://thescipub.com/abstract/ajassp.2013.403.413
AB  - In a Mobile device, apart from the battery and memory, the execution time is the key design constraint for executing the scripts of complex and unstructured JavaScript in the web-browser.  Abstract Syntax Tree (AST) is a better option for mobile code as it is compiled only once. Due to very recursive nature of the AST, its traversal is going to be inherently recursive. Since use of recursion is out of scope, therefore the ultimate decision would be to emulate the recursive behavior using a set of stacks. We design an algorithm for a non recursive AST based stack, a lightweight interpreter which interprets and evaluates the complex scripts of JavaScript in the allocated time period.