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 1,844 public repositories matching this topic...
fuzzer for generative testing of ECMAScript parsers
-
Updated
Jul 3, 2014 - CoffeeScript
trigger events based on esquery selectors during a traversal of a SpiderMonkey format AST
-
Updated
Sep 9, 2014 - CoffeeScript
confirm that a SpiderMonkey format AST represents an ECMAScript program
-
Updated
Aug 24, 2015 - JavaScript
为代码自动加 try-catch,捕获异常。wrap function body with try-catch
-
Updated
Oct 14, 2015 - JavaScript
transformations from Clang AST to MemCAD AST
-
Updated
Dec 2, 2015 - OCaml
A small MongoDB Interpreter created with C .
-
Updated
Feb 4, 2016 - C
esmangle is mangler / minifier for Mozilla Parser API AST
-
Updated
Mar 2, 2016 - JavaScript
A small ECMAScript parser, tokenizer and minifier written in JavaScript.
-
Updated
Apr 21, 2016 - JavaScript
Babel plugin that scans the AST for require calls and import statements
-
Updated
Jul 1, 2016 - JavaScript
Input code to lexical analysis to syntactic analysis to semantic analysis to code generation.
-
Updated
Aug 8, 2016 - C++
Presentation of the life of an instruction in LLVM / Clang at LSE week
-
Updated
Nov 14, 2016 - Assembly
- Followers
- 10.1k followers
- Wikipedia
- Wikipedia