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 153 public repositories matching this topic...
Awarded as a Second Place Winner For Fall 2018 at the Computer Science Symposium at St.Mary's University in San Antonio Texas for developing a programming language at the Survey of Programming language course instructed and guided by Dr. Arthur Hanna. I have used the metalanguage BNF to specify SOL syntax. This project is not intended to be sold…
-
Updated
Jan 8, 2021
detecting python syntax errors given attribute grammar in BNF form
-
Updated
Mar 25, 2024 - Java
A notepad++ language for EBNF syntax highlighting.
-
Updated
Apr 24, 2018
Localisation de photographies de Gallica-BnF
-
Updated
Feb 23, 2024 - JavaScript
First and follow calculator for CFG made in C
-
Updated
Apr 8, 2024 - C
Slides and notes for the Backus Naur Form presentation given at the March 15th, 2022 meeting of the Southeast Michigan BSD Users' Group
-
Updated
Mar 16, 2022 - Shell
This Wolfram Language paclet provides an implementation of a system of functional parsers.
-
Updated
May 29, 2023 - Mathematica
'securehttpparser,' written in Lex and C, is the prototype library including Lex Rules to parses HTTP/1.1 header generated from ABNF on RFCs related to HTTP specification.
-
Updated
Jan 12, 2022 - Lex
⌨️ The BNF (Backus Naur Form) programming language IDE submodule for SNU Programming Tools (2D Mode)
-
Updated
Mar 23, 2024 - HTML
Simple parser for modified basicDTD LL(1) grammar written in Python
-
Updated
Feb 22, 2017 - Python
- Followers
- 10.1k followers
- Wikipedia
- Wikipedia