ast
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
Here are 418 public repositories matching this topic...
PHP serialize and unserialize for NodeJS (with useful error messages)
-
Updated
Mar 16, 2020 - JavaScript
Automation for JS Abstract Syntax Tree generation using @babel.
-
Updated
Jul 24, 2025 - JavaScript
JS aplikacija za prikaz pop-up prozora sa informacijama
-
Updated
May 29, 2021 - JavaScript
transform the ast on a recursive walk
-
Updated
May 11, 2020 - JavaScript
AST visualizer and manipulator in Ember
-
Updated
Apr 23, 2024 - JavaScript
Analysis the string template of the html structure, and return the real dom. Only for Browser Environment.
-
Updated
Jun 11, 2025 - JavaScript
Created my own linter using esprima and AST
-
Updated
Oct 18, 2025 - JavaScript
A small experimental tool to explore how JavaScript features are actually used across real-world repositories — and how the Pareto principle (80/20 rule) might apply to code
-
Updated
Oct 19, 2025 - JavaScript
- Followers
- 11k followers
- Website
- github.com/topics/parsing
- Wikipedia
- Wikipedia