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 296 public repositories matching this topic...
-
Updated
Jan 9, 2022 - TypeScript
Handwritten Lua parser in TypeScript
-
Updated
Jul 28, 2022 - TypeScript
🔄 Parse and evaluate Javascript-like expressions
-
Updated
Oct 28, 2023 - TypeScript
EcmaScript: Syntax Tree Tooling
-
Updated
May 4, 2018 - TypeScript
Walk unist trees with enter and leave functions
-
Updated
Jul 11, 2022 - TypeScript
An advanced tokenizer made with typescript
-
Updated
Feb 26, 2024 - TypeScript
CSS parser for node and the browser
-
Updated
May 20, 2024 - TypeScript
VSCode extension that seamlessly syncs and autocompletes TypeScript variable names and types, turning declarations into `const apple: Apple.`
-
Updated
Sep 11, 2023 - TypeScript
An ast printer based on astring for meriyah's ast format
-
Updated
Oct 1, 2021 - TypeScript
Parse any kind of broken json for scrapping easily
-
Updated
May 7, 2024 - TypeScript
Quick demo of Search-and-Replace with TSQuery
-
Updated
Jul 5, 2018 - TypeScript
- Followers
- 10.1k followers
- Wikipedia
- Wikipedia