-
Updated
May 10, 2022 - Java
grammar
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 856 public repositories matching this topic...
-
Updated
May 10, 2022 - TypeScript
-
Updated
May 10, 2022 - TypeScript
-
Updated
May 10, 2022 - Java
-
Updated
May 2, 2022 - Rust
-
Updated
May 6, 2022 - TypeScript
-
Updated
May 5, 2022 - Python
-
Updated
Apr 26, 2022 - Go
The rust code in the .lalrpop files are still on rust 2015 and need to be manually updated since cargo fix won't work on those files.
We should also update the generated code to emit 2018 idiomatic code (see #2018 )
-
Updated
Apr 21, 2022 - C++
-
Updated
May 10, 2022 - TypeScript
-
Updated
Apr 16, 2022 - Rust
-
Updated
Mar 16, 2022 - Python
-
Updated
Nov 2, 2021 - Vim script
-
Updated
Apr 13, 2022 - JavaScript
-
Updated
Apr 28, 2022 - JavaScript
It's currently just a sequence, which is not necessary.
-
Updated
May 6, 2022 - C
-
Updated
Apr 20, 2022 - Java
-
Updated
Aug 13, 2021 - Python
Tokenizer.pipe, Rules.suggest and maybe some other methods should return an iterator instead of a Vec<_> for more flexibility.
-
Updated
Feb 7, 2022 - C++
-
Updated
May 10, 2022
-
Updated
May 9, 2022 - JavaScript
- Wikipedia
- Wikipedia
It would be great to see a tutorial on how to port a pyparsing based project to Lark.