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 16 public repositories matching this topic...
An on-the-fly parser for BNF grammars
-
Updated
Feb 17, 2022 - Java
Basic Interpreter for C like language written in Java
-
Updated
Dec 5, 2019 - Java
Snap Programming Language
-
Updated
Feb 9, 2019 - Java
Mujeed (مُجيد) is a development environment for logic programming in Arabic language
-
Updated
Mar 17, 2017 - Java
Knife is a Java top-down parser generator for building parsers from grammars in BNF format.
-
Updated
Apr 17, 2020 - Java
A toy programming language including jflex scanner, cup parser and semantic validation. Executably by console and by gui (a toy-IDE).
-
Updated
Jul 17, 2021 - Java
Grammax is a Java bottom-up SLR/CLR parser generator that builds parsers from grammars in Backus-Naur-Form.
-
Updated
Sep 24, 2020 - Java
detecting python syntax errors given attribute grammar in BNF form
-
Updated
Mar 25, 2024 - Java
Implemented a top-down, recursive-descent parser for given BNF for the project language X.
-
Updated
Mar 28, 2020 - Java
A LL1 algorithm implementation for CFG and string recognition.
-
Updated
Oct 30, 2019 - Java
Task #1 from the Programming Langues course at Afeka Engineering.
-
Updated
Apr 3, 2021 - Java
- Followers
- 10.4k followers
- Wikipedia
- Wikipedia