bnf
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 12 public repositories matching this topic...
First and follow calculator for CFG made in C
-
Updated
Apr 8, 2024 - C
-
Updated
May 25, 2020 - C
A small MongoDB Interpreter created with C .
-
Updated
Feb 4, 2016 - C
Context-free grammar parsing library
-
Updated
Feb 19, 2022 - C
Ash - alpha shell.
-
Updated
Sep 16, 2017 - C
Vamos construir um compilador. Tradução e adaptação do tutorial Let's Build A Compiler de Jack Crenshaw.
-
Updated
Apr 2, 2022 - C
Math ExpressionParser using BNF
-
Updated
Feb 7, 2015 - C
Building a simple programming language based on arithmetic expressions using a top-down recursive descent parser written in Python and C.
-
Updated
Jan 21, 2019 - C
A basic C language compiler from scratch.
-
Updated
May 9, 2019 - C
Parser for treebanks based on Penn Treebank type of encoding that generates Probabilistic Context Free Grammars
-
Updated
Oct 17, 2018 - C
BNF wrangling and railroad diagrams
-
Updated
Sep 25, 2023 - C
- Followers
- 10.4k followers
- Wikipedia
- Wikipedia