JavaScript’s power and flexibility are shown through its wide array of libraries and frameworks, which include Angular, Node.js, React, and more. Each takes different approaches to empower the various goals of software engineers.

In this course, you’ll be introduced to the various processes of these unique frameworks as you develop a new open-source solution: Assma.js. You’ll become acquainted with compilation theory before defining logical operators. Next, you’ll delimit functions by creating production rules and define the elements of the programming language, including the syntax and semantics in the framework. You’ll finalize the core of the framework using DOM and tree structures before bundling the packages into a plugin component to manage future projects.

By the end of the course, you’ll have a deep understanding of core functions, design theories, and the creation of JavaScript frameworks from conception to deployment.

Discover: JavaScript Frameworks Behind the Scenes

Compilation is a computing notion as well as a procedure that converts an input written in a source language into an output that the target system can comprehend.
Every formal language has an alphabet (a collection of symbols), strings (sequences of symbols), and sentences (sequences of strings).
Sentences in a language define every potential string arrangement that a language may create while adhering to a set of grammatical rules.

Compilation is divided into multiple stages.

# Syntactic analysis

Syntactic analysis, also known as parsing, is the second stage of the compilation process and comes just after the lexical analysis stage. This stage intervenes to check if the given input string follows the rules and the structure of the formal grammar. The input string can be considered as the token stream generated by the lexical analyzer.

At this point, we can consider that the syntactic analysis has the following two roles:
- It checks if the flow of tokens forms a succession of sentences that respect the rules behind the syntax of the language.
- It transforms the token flow into an abstract syntax tree (AST).

Parsing is not limited to determining whether a sentence can be generated by grammar. Two other important aims are listed below:
- An error must be thrown if the sentence can't be generated according to the grammar.
- If the sentence is considered a valid sequence of string tokens, the parser builds an internal representation of the input string that makes it possible to carry out other verifications. This internal representation is called an abstract syntax tree.

Understand the syntactic analysis stage, the abstract syntax tree, and some parsing methods.

Course

Compilation Theory

Syntactic analysis