Javascript Interpreter Using Non Recursive Abstract Syntax Tree Based Stack

Abstract

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

Robust Memory Management Using Real Time Concepts

“…Anbumozhi and Manoharan (2014) proposed a method of fuzzy based image fusion in that the author highlighted the need for limited memory buffers with low computational complexity in order to reduce the hardware cost. Due to the limited memory capacity of mobile devices the AST node is generated and executed only when required and there is no need of converting all AST nodes to respective code bytes (Patra et al, 2013).…”