BNF and EBNF Grammer Parser

Created on March 06, 2019

2019

  • Implemented Extended Backus-Naur Form grammer parser from scratch.
  • Following is a sample grammer that can be parsed using this implementation:

    S := ‘Hello’ | ‘Hi’ P | P | ‘bye’
    P := ‘World’ | ‘Everyone’ | ‘[A-Za-z0-9]+ ‘ | ‘a’

  • Developed in Python.
  • Git Repository


Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • Monocular Visual Odometry in Rust (KITTI)
  • DAC SDC 2022 – FPGA-Friendly CNN (UBPercept)
  • DAC SDC 2022 - 4th Place (UBPercept)
  • Cleaner Bot – Coverage Planning Demo
  • EBNF Grammar Parser in Python