parser-generator
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 44 public repositories matching this topic...
Lemon PureBasic Parser Generator
-
Updated
Aug 12, 2021 - C
Just another high-level language implementation
-
Updated
Feb 21, 2021 - C
Experiments done during 7th semester of B.tech CSE for Compiler Lab at KTU
-
Updated
Feb 6, 2023 - C
An LALR(1) parser generator for C or C++
-
Updated
Aug 6, 2014 - C
Lambda calculus expression simplifier repl
-
Updated
Nov 10, 2018 - C
Compilers lab in 6th semester
-
Updated
May 7, 2024 - C
Tree-sitter parser for HTTP Multipart content
-
Updated
Jul 27, 2022 - C
Yacc implementing the algorithms in Dragon Book, including efficiently constructing LALR(1) DFA
-
Updated
Jun 15, 2018 - C
Parser generator using Parsing Expression Grammars (originally by Ian Piumarta)
-
Updated
Apr 14, 2023 - C
Parser generator for languages with grammar given by arbitrary sequences of tokens
-
Updated
Aug 3, 2023 - C
rbison - a clear version of the GNU utility bison
-
Updated
Feb 14, 2023 - C
- Followers
- 10.2k followers
- Wikipedia
- Wikipedia