Context-Free Grammars Courses and Certifications

Automata Theory

20 reviews

Stanford University's 7-week course explores Automata Theory, covering finite automata, regular languages, context-free grammars, Turing machines, and intractable problems. Requires 5-10 hours/week.

• edX
• 7 weeks, 5-10 hours a week
• On-Demand
• Free Online Course (Audit)

Formal Languages and Automata Theory

156 ratings at Udemy

Explore the theoretical foundations of computer science with this 31-hour course. Learn about automata theory, formal languages, grammar, and computability, and apply these concepts to real-world problems.

• Udemy
• 31 hours
• On-Demand
• Paid Course

NPTEL;  IIT Kanpur

Theory of Computation

4 reviews

Explore the theory of computation with NPTEL's 39-hour program. Learn about finite automaton, regular languages, nondeterministic finite automata, context-free languages, and Turing machines.

• YouTube
• 1 day 15 hours
• On-Demand
• Free Online Course

Sundeep Saradhi Kanthety

Greibach Normal Form and Conversion of Context Free Grammar to GNF in Automata Theory

Dive into Automata Theory with Sundeep Saradhi Kanthety's comprehensive program. Learn about finite automata, DFA, NFA, regular expressions, and context-free grammar in under an hour.

• YouTube
• 27 minutes
• On-Demand
• Free Online Course

Sundeep Saradhi Kanthety

Chomsky Normal Form and Conversion of CFG to CNF in Automata Theory

Learn Chomsky Normal Form and conversion of CFG to CNF in Automata Theory in less than an hour with Sundeep Saradhi Kanthety.

• YouTube
• 31 minutes
• On-Demand
• Free Online Course

CppNow

Compile-time Reparsing - C++Now 2012

Explore the concept of compile-time 'reparsing' in C++ with Gordon Woodhull's talk from CppNow. Dive into metaprogramming libraries for Embedded Domain Specific Languages in just 1-2 hours.

• YouTube
• 1 hour 12 minutes
• On-Demand
• Conference Talk

EuroPython Conference

Learn from LL-1 to PEG Parser the Hard Way

Explore the fundamentals of Parser, PEG, Packrat parser, and their use in Python in this less than 1-hour material from EuroPython Conference. Ideal for all levels of compiler knowledge.

• YouTube
• 41 minutes
• On-Demand
• Conference Talk

Alexander Amini;  MIT

Deep CPCFG for Information Extraction

Explore deep learning and information extraction with MIT's Alexander Amini. Learn about context-free grammars, parsing, and handling noise in under an hour.

• YouTube
• 41 minutes
• On-Demand
• Free Online Course

Paul G. Allen School

Probabilistic Models for Learning a Semantic Parser Lexicon

Explore probabilistic models for semantic parser lexicon learning with Paul G. Allen School. Improve accuracy and efficiency in semantic parsing with less human input. Less than 1-hour workload.

• YouTube
• 42 minutes
• On-Demand
• Free Online Course

Write your own Operating System

Context-Free Grammars - LR(k) Grammars

Learn the LR-Technique for constructing a parser from a Context-Free Grammar in less than an hour with Write your own Operating System.

• YouTube
• 49 minutes
• On-Demand
• Free Online Course

Write your own Operating System

Context-Free Grammars - LL(k) Grammars

Learn to translate Context-Free Grammars to deterministic parsers/compilers with 'Write your own Operating System' in 1-2 hours. Includes hand-written parser creation.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Online Course

Write your own Operating System

Context-Free Grammars

Learn about Context-Free Grammars, crucial in parsers/compilers design, in under an hour with practical advice and assignments from Write your own Operating System.

• YouTube
• 45 minutes
• On-Demand
• Free Online Course

IEEE

Eliminating Input-Based Attacks by Deriving Automated Encoders and Decoders from Context-Free Grammars

Learn to eliminate input-based attacks using McHammerCoder, an automated encoder and decoder generator, in this short IEEE workshop.

• YouTube
• 25 minutes
• On-Demand
• Conference Talk

Black Hat

Another Brick Off the Wall - Deconstructing Web Application Firewalls Using Automata Learning

Learn to audit Web Application Firewalls (WAFs) with Black Hat's under 1-hour material. Understand WAF internals, bypasses, and use of automata learning for auditing.

• YouTube
• 44 minutes
• On-Demand
• Conference Talk

Theory of Computation

Dive into the Theory of Computation with this 10-hour online program. Learn about languages, automata, grammars, DFA, NFA, Moore and Mealy machines, regular expressions, and Turing machines.

• YouTube
• 10 hours
• On-Demand
• Free Online Course