Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

Writing Parsers in C++ ( for MathExpressions / SQL etc )

Name: Writing Parsers in C++ ( for MathExpressions / SQL etc )
Rating: 4.5 (21 reviews)

C++ projects, SQL Query parser, Advanced Math Expression Parsers, C/C++ project, CFG Grammar implementation

Created byAbhishek CSEPracticals, Shiwani Nigam, Ekta Ekta

Last updated 1/2024

English

What you'll learn

Writing Parsers
Calculation of Complex mathematical expressions
Parser for SQL Queries
Implementing Grammars in C/C++

Course content

10 sections • 50 lectures • 7h 18m total length

Teaser !1:15
Agenda7:28
Code Access3:42
Presentation for this Course.
Checking the Git Checkpoint3:06

Road Map of this Course2:35
By the end of this section, the Src code snapshot would be pointed to by this git hashcode : 09b5e974211fda2b61adf475aaa05d0f0e7f5331

How to setup this commit hashcode, pls follow the below steps :

Download git repo :

https://github.com/sachinites/MathExpressionParser

switch to branch Oops

git checkout Oops

Set the git head to above hash code

git reset --hard 09b5e974211fda2b61adf475aaa05d0f0e7f5331

To comeback to latest commit :

git pull

Now check files in MathExpressionParser/Course

I am attaching the fully fixed Parser.l and ParserExport.h file with the last lecture in this section, because we needed to fix a couple of bugs in these sections as those bugs went undetected and could not be found until very later stage in this course.

Therefore, pls download these attached files from the last lecture of this section, and ensure you have fully fixed files in your codes. Files are Parser.l and ParserExport.h files.
Creating Parser.l file29:04
Regular expressions used in this lecture can be copy pasted from the attached text file.
Adding more Regular Expressions
yylex( ) and Regular Expression Matching6:21
Developing Parser Infrastructure1:44
Setting up Lexical Stack5:54
Parser Global Variable ( Cursor )1:29
cyylex() and yyrewind()24:01
Add two more APIs by yourself
Checkpointing the Lexical Stack5:12
Creating a ParserExport.h file4:05
Lets Write Demo Parser22:15
Mandatory Assignment
Final Touch !8:57
I am attaching the fully fixed Parser.l and ParserExport.h file here, because we needed to fix couple of bugs in these section as those bugs went undetected and could not be found until very later stage in this course.
Therefore, pls download these attach files and ensure you have fully fixed files in your codes.

Expression Tree Class Diagram9:58
Adding New Data type Classes2:07
Adding New Operator Classes1:13
What we have so far !3:19
Implement factory Methods
Implementing Virtual functions for Dtype Class4:08
Expression Tree Construction Algorithm9:23
Expression Tree Construction Algorithm Implementation10:28
Mandatory Assignment
Implementing clone () Virtual fn10:37
Implementing Validation Algorithm - Part116:28
Implementing Validation Algorithm - Part24:48
Mandatory Assignment - Update ResultStorageType( ) for all Operators
Implementing Evaluation Algorithm - Part117:45
Implementing Evaluation Algorithm - Part25:40
Assignment - Build Advance Calculator3:23
Assignment

Requirements

Basic OOPs Concepts
Using an Writing Regular Expressions
Infix to postfix Conversion involving advanced Operators

Description

Have you ever thought about how front-end CLIs or command lines are written for various CLI-based devices?

for example, How to write a Parser for SQL Queries?

How to write a parser to parse mathematical expressions and evaluate them only when they are valid?

Then this is the course that promises implementation of Generic Parsers in C/CplusPlus.

In this course, we will be going to write OOPs-based C++ code to build the Parser a.k.a Mathematical Expression Library. This library helps the programmer to develop applications with ease that require the calculation of tedious mathematical expressions. Not only that, We will also cover how to parse Expressions representing Inequalities or logical expressions.

Once this project is fully ready and tested, we will import this project as a black box to solve even bigger projects such as the Implementation of RDBMS from Scratch.

So best of luck and Happy learning. This course is very interesting and I am sure you will going to enjoy it a lot in this course. This will be a sporty course!

Pre-requisite for this course

Basic Regular Expressions

OOPs basic concepts

Binary Search Tree Algorithms ( Post-Order )

Infix to postfix conversion

Agenda

Writer Parsers using Lex ( GNU Lexical analyzer )

Implement Grammars in C/CplusPlus

Construct and Build Expression Trees

Evaluate Expression Trees, Inequalities, and Logical Expressions

Case Study

Writing Parsers to Parse SQL Queries

Who this course is for:

Engineering Grauates
RDBMS developers
Working professional, Developers and Coders

Writing Parsers in C++ ( for MathExpressions / SQL etc )

What you'll learn

Explore related topics

Course content

Introduction4 lectures • 16min

Setting up the Parser11 lectures • 1hr 52min

Context Free Grammar ( CFG )6 lectures • 57min

CFG for MathExpressions5 lectures • 48min

Infix to Postfix Conversion2 lectures • 18min

Construction of Expression Trees13 lectures • 1hr 39min

Operand Resolution4 lectures • 58min

Implementing Logical Operators4 lectures • 31min

Creating Mexpr Library0

Advanced Operations On Expression Trees1 lecture • 1min

Requirements

Description

Who this course is for: