-
Updated
Jul 2, 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 864 public repositories matching this topic...
-
Updated
Jun 30, 2022 - TypeScript
-
Updated
Jul 1, 2022 - TypeScript
-
Updated
Jul 2, 2022 - Java
-
Updated
Jul 1, 2022 - Rust
-
Updated
May 6, 2022 - TypeScript
-
Updated
Jul 1, 2022 - Python
-
Updated
Jul 1, 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
Jun 30, 2022 - C++
-
Updated
Jun 8, 2022 - TypeScript
-
Updated
Jun 30, 2022 - Python
-
Updated
Jun 30, 2022 - Rust
-
Updated
Jun 10, 2022 - Vim script
-
Updated
Apr 13, 2022 - JavaScript
I'm trying out lexy with a re-implementation of a parser I've already got which, in part, parses register names of the form r<0..31> and f<0..15> - i.e. there are 32 general purpose registers (named r0, r1, ... r31) and 16 floating point registers.
I'd like to verify that the register number is in range when parsed, so I'd like to have something like lexy::code_point, which has tr
-
Updated
Jun 23, 2022 - JavaScript
-
Updated
Jul 1, 2022 - Java
-
Updated
May 16, 2022 - C
-
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 11, 2022
-
Updated
Jun 1, 2022 - JavaScript
- Wikipedia
- Wikipedia
It would be great to see a tutorial on how to port a pyparsing based project to Lark.