Register

Context Free Grammars

• retagged by
221 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
atulcse asked Jan 21, 2022
869 views
parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
User Avatar
1 votes
1 votes
1 answer
2
Garrett McClure asked Oct 14, 2017
992 views
Theory of Computation - Find context-free grammars for the following language
Find a context-free grammar for the following language (with n ≥ 0, m ≥ 0): L = {anwwRbn : w ∈ {a, b} ∗ , n ≥ 1}.
Find a context-free grammar for the following language (with n ≥ 0, m ≥ 0):L = {anwwRbn : w ∈ {a, b} ∗ , n ≥ 1}.
User Avatar
1 votes
1 votes
1 answer
4
practicalmetal asked Mar 20, 2023
371 views
Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
User Avatar
Link Copied!