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,382 public repositories matching this topic...
-
Updated
Mar 31, 2022 - JavaScript
-
Updated
Jun 5, 2022 - PHP
-
Updated
May 29, 2022 - JavaScript
-
Updated
Jun 1, 2022 - JavaScript
-
Updated
Jun 2, 2022 - Java
-
Updated
Jun 4, 2022 - Java
-
Updated
Jun 4, 2022 - TypeScript
-
Updated
Mar 8, 2022 - JavaScript
-
Updated
May 23, 2022 - JavaScript
Is your feature request related to a problem? Please describe.
No MappedTypeNode definition in ts-morph.
No TypeQueryNode definition in ts-morph.
No TypeOperatorNode definition in ts-morph.
-
Updated
Apr 9, 2022 - JavaScript
-
Updated
May 24, 2022 - Go
-
Updated
May 23, 2022 - Go
-
Updated
May 9, 2017 - JavaScript
-
Updated
Jan 29, 2022 - JavaScript
-
Updated
Oct 29, 2019 - Go
Piranha transforms:
someConsumer.accept((x) -> {
if(exp.isTreated(STALE_FLAG)){
doSomething(x);
}
else{
domeSomethingElse(x);
}
-
Updated
May 30, 2022 - C++
-
Updated
May 31, 2022 - PHP
problem: the shadow classes (CtClass reflecting a binary class) built by JavaReflectionTreeBuilder can be modified. This is confusing for users, see INRIA/spoon#4664.
solution: the JavaReflectionTreeBuilder should construct immutable objects, closed to modification, where all setters throw an UnsupportedOperationException
- Wikipedia
- Wikipedia


How are you using Babel?
babel-loader (webpack)
Input code
Configuration file name
No response
Configuration
No response
Current and expected behavior
Logs