context-free-grammar

context-free-grammar

if there is a production that contains a nonterminal nullable, then is that production nullable?

Find a Context-Free Grammar

context free grammar with certain inequalities

Proving that the set difference of a CFG and a regular language is also context free

CFG for string of length 3

Context free grammer for a language

Difference between context-free errors, context-sensitive errors, and runtime errors

CFL Pumping Lemma L = {a^n b^m c^k d^k | n>m}

Constructing Context Free Grammar From The Following Regular Expression

Is this languages REGULAR / CONTEXT FREE but not REG / Nothing?

Context-Free Grammar suggestions for unary subtraction?

Pyparsing: Parsing unique longest match in parentheses

Can you help me understand this answer?

BNF (EBNF) to describe table format with optional columns

How to convert cfg to pda with 2 states?

Will this make my grammar ambigious?

Context-free grammar for L = {2^x ∗ 2^y ∗ 2^z = 2^(x+y+z) | x, y, z > 0}

Given the following language L, provide a CFG or prove it isn't context free

For a context free grammar, how do i convert it to an equivalent push down automaton?

classify as regular, context free, or other

Context free grammar for balanced parethesis

What is the relationship between derivation and derivation trees?

Preferred way of removing left recursion of EBNF

Nullable nonterminals

Matching Tags in CFG: Is it possible to define a suchlike production?

How to generate the FIRST set of this context-free grammer

Parsing consecutive non-terminals

Eliminating epsilon rules

Is this grammar context free or not?

Compilers: change ambiguous grammar

Which piece of code is syntactically invalid?

Why regular languages should not have unit rules Variable -> Variable?

context free grammer and removing left recursion

CAN Inherently ambiguous languages HAVE DETERMINISTIC CONTEXT FREE GRAMMARS?

understanding basics of CFG

Write a Context-Free Grammar for following language

Context free grammar for languages with more number of as than bs

Automata: CFG for following language

Context Free Grammar - set of strings in which the number of 1’s is one more than the number of 0’s

Computer Theory: CFG and Regular Languages

Why are deterministic context free languages (DCFL) not closed under UNION operation and context free languages are closed under union?

Proving language is regular

Write EBNF form for a year/month/day

Solution to a joke related to EBNF

Proving language is context-free with pumping lemma

How to prove that a grammar is unambiguous?

Context free grammar syntax

Context Free Grammar for unequal number of symbols

Tips for a CFG for given L

How to choose which rule to use in CFG derivation?

Pushdown Automata for Palindrones

Is it a right way to find the regular grammar by construct an DFA?

How can I prove this grammar is ambiguous?

Generating CFG for a Language

Create a CFG for the following languages

Count letter frequency in PDA

Example of a recursively enumerable language that is not context free

Provide a context free grammar for the following languages:

if L = P ∩ Q where P is Context Free Language(CFL) and Q is Regular then L is in?

Context-free grammar for language L = a^(2^k)

page:1 of 4 next page main page

Categories

google-play-services

firebase-database

basic-authentication

backpack-for-laravel

linq-to-entities

cordova-plugins

facebook-instant-articles

django-crispy-forms

webdrivermanager-java

biological-neural-network

google-email-audit-api

boost-coroutine

shell-extensions

teamstudio-unplugged

validationrules

google-provisioning-api

Resources