Home > Articles > Web Development > Ajax and JavaScript

Making JavaScript Fast, Part 1

📄 Contents

  1. Interpreting or Compiling?
  2. Object Models
  3. Fast Lookup
JavaScript speed is a major selling point for modern browsers, although many of the techniques employed originate from dynamic language research conducted in the 1980s. David Chisnall discusses how these techniques work.
Like this article? We recommend

Over a decade ago, Netscape changed the face of the Web by providing a scripting language that ran in the browser. Suddenly, it became possible to run programs in web pages. The JavaScript language is heavily influenced by Self but, although Self is one of the fastest dynamic languages around, JavaScript was very slow. Most of the time, people did nothing more with JavaScript than animate menus and make things go "Ding."

More recently, this situation has changed. The concept of a web application has started to gain traction, and the new breed has started doing a lot more on the client side, using JavaScript[md]now all grown up and standardized as ECMAScript.

When a web page was just using JavaScript for animating menus, most of the CPU time was spent in the browser's rendering engine, even with a very slow JavaScript implementation. Now, things like Google Spreadsheets are running large numbers of calculations, and people are starting to notice when the script is slow. For this reason, the latest browsers are all boasting about how fast their JavaScript implementations are. A lot of the new-and-exciting improvements are implementations of research done in the 1980s on languages like Smalltalk and Self. In this series, we'll take a look at exactly how they work.

Interpreting or Compiling?

Anyone who has worked on a big software project can tell you that compiling a program takes time. A compiler first has to take a long stream of text and split it into tokens[md]identifiers, special symbols, keywords, and so on. It then takes this token stream and turns it into a parse tree, which is a concrete representation of the syntactic structure of the program. For example, the for statement in C-like languages is a simple structure containing pointers to the initializer, test, increment, and loop body.

Next, the compiler turns the parse tree into an abstract syntax tree (AST). This is similar to the parse tree, but removes syntactic sugar. Typically, an AST might restrict itself to a single type of loop, for example. Things like the add-and-assign operation (+=) might be represented by a single node in the parse tree, pointing to the expression and the target, but in the AST would be represented by separate addition and assignment nodes. The line is blurred somewhat in languages such as Lisp, Self, Smalltalk, or Io, where the concrete syntax of the language closely matches the abstract syntax, but a language like JavaScript often has several ways of expressing the same thing, so the translation from concrete syntax to abstract syntax can be quite time-consuming.

The simplest kind of interpreter runs the AST directly. Each AST node might be represented by an object, and implement something like a "run in context" method. To run a program, you perform a traversal of the tree, with each AST node recursively evaluating its children. This process is very slow. For example, to run the add-and-assign operation, you would call the method first in the assign node. This would then call it in the add node, which would have two children, one being the original value and the other being the expression to add. You would have to call all of these methods for a simple statement that, in compiled code, would be a small handful of instructions.

Why do people implement languages this way? This approach has two advantages:

  • It's easy. Code that's easy to write is easy to make bug-free. It's also very small, which was very important on older browsers that were expected to run on computers with 4MB (or less) of RAM.
  • It gives very quick load times.

Load times are very important on a web page. If a desktop application takes 30 seconds to compile, no one cares. The author or packager will do the compiling, or maybe the end user when installing, but then it won't need to be done again. If compiling makes the program run faster, spending a bit of time at the start is a huge overall gain, which is why most desktop software is still compiled (although this situation is changing).

In a web browser, the perception of that 30 seconds is very different. Imagine waiting 30 seconds after a web page had been downloaded before the scripts started working. For a lot of sites, the user would have given up and abandoned the page before compiling finished. Worse, the scripts may only run for a small fraction of a second of CPU time. Even if you're taking only one second to compile them, that still may be more time for the compiler than the AST-interpreter would take to run the script.

Although dynamic languages have been compiled for a while, many still use a halfway step, somewhere between interpreting an AST and compiling. In this technique, the AST is compiled into something called bytecode. This term is often used fairly generally now to mean machine code for any virtual machine, but it technically means machine code for an instruction set where every operation code (opcode) is one byte.

The advantage of one-byte opcodes is obvious: It's easy to implement them with a simple jump table. A bytecode interpreter looks like a massive switch statement. Each instruction is run by loading it, adding its value to a fixed address, and then jumping there. The jump target contains code to run the instruction and then jump back to the top of the switch statement with the next instruction.

Bytecode interpreters are (usually) slower than compiled code, but not by much. A bytecode instruction often maps to a short sequence of machine instructions, so the overhead from the jump table is relatively small. A well-designed bytecode can come close to half the speed of compiled code, although 1/10 the speed is more common in real-world use. Still a lot slower, but generating bytecode from an AST is usually very fast, so the startup time is low and performance is "good enough."

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020