Context-Free Grammars Courses and Certifications

Write your own Operating System

Context-Free Grammars - LR(k) Grammars

Explore the LR-Technique for parser construction, covering state transitions, nonterminals, reduce conflicts, follow sets, and LR1 grammars.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Write your own Operating System

Context-Free Grammars

Learn about Context-Free Grammars, their role in parser and compiler design, and applications in programming languages. Gain practical advice and understand associativity concepts.

• YouTube
• 45 minutes
• On-Demand
• Free Video

Center for Language & Speech Processing(CLSP), JHU

Weak and Strong Learning of Context-Free Grammars - 2012

Explore recent advancements in unsupervised learning of context-free grammars and the transition from weak to strong learning algorithms for accurate syntactic structure prediction.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Center for Language & Speech Processing(CLSP), JHU

Language Modeling and Context-Free Grammars

Explore language modeling and context-free grammars with Ryan Cotterell in this JSALT 2023 lecture, delving into advanced concepts in computational linguistics.

• YouTube
• 1 hour 16 minutes
• On-Demand
• Free Video

Center for Language & Speech Processing(CLSP), JHU

Weak and Strong Learning of Context-Free Grammars

Explore weak and strong learning approaches for context-free grammars in computational linguistics and formal language theory with expert insights from Royal Holloway University.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Derivation Visualization for Context-Free Grammar Design - Helping Students Understand Context-Free Grammars

Discover a dynamic visualization tool for context-free grammar design that helps students understand derivation trees and debug grammars through stepwise construction.

• YouTube
• 23 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Detecting and Explaining In-Equivalence of Context-Free Grammars

Discover a scalable framework for deciding and explaining equivalence of context-free grammars using abstract transformations and theory-based comparison algorithms.

• YouTube
• 15 minutes
• On-Demand
• Free Video

Automata Theory

20 reviews

Explore finite automata, context-free grammars, Turing machines, and intractable problems in this comprehensive study of theoretical computer science foundations.

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

Coding Train

Context-Free Grammar - Programming with Text - Session 7

Explore context-free grammar techniques using Tracery and RiTa.js to generate dynamic text and create fractal tree visualizations through recursive programming methods.

• YouTube
• 1 hour 49 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

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

Learn to convert Context-Free Grammars to Chomsky Normal Form, a standardized format for simplifying and analyzing grammars in automata theory. Understand the steps and rules for this important transformation.

• YouTube
• 31 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Saggitarius: A DSL for Specifying Grammatical Domains

Explore Saggitarius, a new DSL for specifying grammatical domains. Learn how it helps programmers reason about data formats and infer grammars for various representations of common data types.

• YouTube
• 17 minutes
• On-Demand
• Free Video

Write your own Operating System

Context-Free Grammars - LL(k) Grammars

Explore context-free grammars and LL(k) parsing, including hands-on implementation of an arithmetic expression parser and techniques for handling recursive rules.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

IEEE

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

Learn to derive automated encoders and decoders from context-free grammars to eliminate input-based attacks, enhancing security in complex language communication systems.

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

ACM SIGPLAN

Semantics-Preserving Transformation of Context-Free Grammars into LL(1) Form

Discover a method for transforming context-free grammars into LL(1) form while preserving original semantics using tree-based representations for efficient parser construction.

• YouTube
• 31 minutes
• On-Demand
• Free Video

NPTEL;  IIT Kanpur

Theory of Computation

6 reviews

Explore finite automata, regular languages, context-free grammars, and Turing machines. Learn about computational models, their properties, and fundamental concepts in theoretical computer science.

• YouTube
• 1 day 15 hours
• On-Demand
• Free Video