Writing Parsers in C++ ( for MathExpressions / SQL etc )
Learn C++, SQL parsing, and advanced math expression parsing. Build C/C++ projects & implement CFG grammars. Boost your programming skills!
Course Content
Writing Parsers in C++ ( for MathExpressions / SQL etc ) is an intermediate-level Udemy course taught by Abhishek CSEPracticals. It runs 7h 18m, is taught in English, and includes a certificate of completion. Learners rate it 4.5 out of 5 from 18 reviews, with 390 students enrolled. It is a paid course, last updated January 2024.
Unlock the power of command-line interfaces (CLIs) and parsers with this practical C/C++ course! Learn to build generic parsers for a variety of applications, from SQL query parsing to evaluating mathematical expressions.
This course dives into developing an OOPs-based C++ Parser, essentially creating a Mathematical Expression Library. You'll gain hands-on experience building a robust library that simplifies complex calculations within your applications.
Key topics include:
- Mathematical Expression Parsing: Learn to parse and evaluate mathematical expressions, ensuring validity and accurate results.
- Logical and Inequality Parsing: Extend your parsing skills to handle expressions involving inequalities and logical operators.
- Parser Implementation with Lex: Discover how to write writer parsers using Lex (GNU Lexical analyzer) for efficient tokenization.
- Grammar Implementation in C/C++: Master the techniques for defining and implementing grammars within your C/C++ code.
- Expression Tree Construction: Learn to construct and build expression trees for efficient evaluation.
- Expression Evaluation: Implement algorithms to evaluate expression trees, including handling inequalities and logical expressions.
- Real-World Application: SQL Query Parsing: A comprehensive case study demonstrating how to write parsers to parse SQL queries, a crucial skill for database development.
Prerequisites:
- Basic Regular Expressions
- OOPs (Object-Oriented Programming) concepts
- Binary Search Tree Algorithms (Post-Order Traversal)
- Infix to Postfix Conversion
Bonus: This project is designed to be scalable! Once completed and thoroughly tested, you can integrate it as a black box into even larger projects, such as the implementation of an RDBMS from scratch.
Get ready for a challenging and rewarding learning experience! This course is designed to be engaging and enjoyable, providing you with the skills to confidently tackle complex parsing tasks. It's a truly sporty course that will sharpen your programming abilities. Happy learning!
Need a web app built? Hire the team behind TutorialSearch.io
We ship fast, production-grade full-stack apps (Next.js, React, edge infra) — the same stack that powers this site.