lalr
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 32 public repositories matching this topic...
-
Updated
Sep 30, 2020 - C
-
Updated
Sep 13, 2020 - Python
-
Updated
Jul 15, 2020 - C++
-
Updated
Aug 2, 2020 - Rust
-
Updated
Nov 24, 2019 - C#
-
Updated
Nov 8, 2020 - F#
-
Updated
May 4, 2018 - C++
-
Updated
Aug 30, 2020 - C++
-
Updated
Nov 1, 2020 - Rust
Allowing the user to trace lexer results would improve the debugging experience.
This should be implemented similar to the parser trace feature: print the current token after each advance as well as the first token after initializing the lexer.
-
Updated
Jan 19, 2019 - Assembly
-
Updated
May 11, 2020 - C
-
Updated
May 2, 2020 - C++
-
Updated
Dec 7, 2018 - C++
-
Updated
Sep 9, 2016 - C#
-
Updated
Jul 28, 2020 - Python
- Wikipedia
- Wikipedia

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.

Perhaps it should be opt-in, but most usage would expect a BOM is ignored.