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
Get Global Declarations and Dependencies of a JavaScript resource.
-
Updated
Feb 11, 2022 - JavaScript
Automation for JS Abstract Syntax Tree generation using @babel.
-
Updated
Jul 24, 2025 - JavaScript
Figma-to-Code converter powered by Model Context Protocol. Features: 11 AST transforms, dual output modes (Tailwind/Pure CSS), Puppeteer validation, shadcn/ui dashboard.
-
Updated
Nov 12, 2025 - JavaScript
Tiny parser for simple CSS selectors, just in ~300 bytes. Pretty similar to what is done in Hyperscript
-
Updated
Dec 6, 2022 - JavaScript
Web app to detect plagiarism is javascript files. Provides the percentage of plagiarism found with file to file comparison. Built using TypeScript, React for frontend, and Node for the backend.
-
Updated
Apr 18, 2023 - 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
Convert TypeScript Code to JavaScript in-place
-
Updated
Oct 18, 2017 - JavaScript
- Followers
- 11k followers
- Website
- github.com/topics/parsing
- Wikipedia
- Wikipedia