How to find the grammar of this language: La = {ww^r: w e {0,1}^*, w ends with 1} ? r: is reverse
Here is my solution:
S -> 0S0|1S1| 0|1|E(epsilon)
What can I change here or is the solution the right one?
how to find the grammar of this Language?
64 Views Asked by sourga bah At
1
There are 1 best solutions below
Related Questions in PALINDROME
- Comparison of Fixnum with nil failed - palindrome program Ruby
- JAVA: Error reversing a string to check for palaindrome off-by-one i think
- One of the solution for finding the longest palindromic substring could not be understood
- Given length L find the shortest string formed only of as & bs >= L such that adding some character (Either a or b) doesn't produce a new palindrome
- Palindrome Check in Java using two Methods will not compile
- How to detect palindrome cycle length in a string?
- generate longest possible palindrome for a given string
- LISP - recursive palindrome
- Javascript Palindrome Function Not Working
- String palindrom check
- Reverse and Compare Palindrome Solution (Cracking the Coding Interview)
- Project Euler - #4 - Java - Trying to fine tune, issue with ArrayLists
- Substring index out of bounds
- Project Euler 4 with python : Largest Palindrome Product
- Why this is not a palindrome?
Related Questions in CONTEXT-FREE-GRAMMAR
- Strings from grammar
- Grammar: Precedence of grammar alternatives
- Context Free Grammar BNF
- Xtext grammar describing cron expression not working as expected
- can removing left recursion introduce ambiguity?
- How to match with a expression grammar only the last time a keyword occurs occurs
- This LL(1) parse table is correct?
- syntax-directed definition to determine the type of expression
- Nullable nonterminals
- Is ε terminal in context-free?
- CFG to Regular expression
- How to fix shift-reduce conflict in this grammar
- How to deal with some ambiguous context free grammar productions in Python
- writing a parser in prolog
- How to Generate and display ParseTree for an expression in C# using Irony?
Related Questions in COMPUTATION-THEORY
- Grammar for a^n
- Is there an algorithm for a compiler compiler that generates a recursive descent parser?
- Is $E_{LBA}$ a Turing recognizable language?
- The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable
- Knuth's bit reversal explanation
- How do I determine the big O for my nested for loop?
- Nullable nonterminals
- YACC: finding shift/reduce conflicts in a grammar
- Can this function be simplified (made more "fast")?
- how to intuitively think while Designing an NFA
- Assisstance with comparisons in primitive recursion
- Speeding up division and remainder when numerator is a multiple of power of two
- Is this a common pattern faced in Computer Science?
- Can abstract models for solving NP-hard problems be built in reality?
- How is Turing Machine which accepts nothing is not Recursively Enumerable?
Related Questions in CHOMSKY-NORMAL-FORM
- Chomsky-normal-form grammar extraction from a parse tree
- How to deal with some ambiguous context free grammar productions in Python
- chomsky normal form
- Converting CFG to CNF,is it correct?
- Removing null productions from a context free grammar
- How can I convert a context-free grammar to Chomsky Normal Form (CNF)?
- Converting context free grammar to chomsky normal form
- Is this CYK parser result correct?
- Chomsky Normal Form conversion
- Context Free Grammars : How do I terminate the lambda in my non-terminal when it has left recursion?
- Stuck in a loop while trying to get Chomsky normal form
- Chromsky normal form unit production
- Parse balanced parentheses CNF
- How to deal with loops when converting from context free to CNF?
- Making context free grammars simpler(prettier)
Related Questions in CHOMSKY-HIERARCHY
- how to find the grammar of this Language?
- How to I constract a grammar that generates this language ? (Grammar of type 0)
- Pumping Lemma and Hierachy
- What is the point of the 4 grammars specified in Chomsky hierarchy?
- Stochastic context-free grammars to Chomsky normal form
- Chomsky Hierarchy and Robot Framework
- If L and L complement are Recursively enumerable then why can't L be a Regular language?
- How can one define a language which does not fit in the Chomsky Hierarchy?
- Chomsky hierarchy - examples with real languages
- How to convert a regular grammar to finite automaton?
- Is L = {a^mb^nc^k | if (m=n) then (n=k) } CFL or not?
- Does Java sit in Type-0 lavel of Chomsky Hierarchy?
- Is a Chomsky type 1 parser generator possible?
- Chomsky Hierarchy: LR(k) grammars vs Deterministic CFGs?
- Is it possible to have a production with one or more terminal(s) in the LHS of a recursively enumerable language?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The phrase
is not correct. "chomsky" is not a tool or approach that can be "used". Moreover, the proposed CFG is not correct for the language, because it can yield strings of odd length, and also strings in which
wends with 0. The following grammar works for the language. However, it is not in Chomsky Normal Form (CNF). You can readily convert it to a grammar that is in CNF if you want.This is an equivalent grammar that is in CNF: