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
- My code that checks if a given number is palindrome or not doesn't work
- Find lexicographically smallest palindrome for a given string
- Build Palindrome from two strings
- Compare two python codes
- Leetcode memory optimisation - Longest Palindromic Substring
- leetcode Palindrome Number c++
- my C function is modifying a char array it shouldn't because it's deliberately out of scope
- Clarification on the Calculation "right - left - 1" in Palindrome Substring Code
- how to find the grammar of this Language?
- Trying to create a function where you input a list of words as a arugment & the function returns only the words that are a Palindrome. How can I?
- Error with my code that checks if a number is a palindrome
- Palindrome number checking. I have the main concept working, not sure if my one MAIN error is fixable though
- Find the First Palindromic String in an Array in js
- Palindrome String
- Some test cases failing while trying to implement palindrome of a string in C without using built in functions
Related Questions in CONTEXT-FREE-GRAMMAR
- Resolve shift/reduction conflict in grammar for expressions in PLY for calls to embedded functions
- Grammar for access to properties and calls to embedded functions
- Need clarification on pumping lemma for context free languages
- Java CUP produces Shift-Reduce conflict when parsing a grammar for a C++ type language
- Correct labeling for this regular language?
- How to recognize a context free grammar with a rust declarative macro
- Maximum recursion depth exceeded with nltk recursive descent parser
- Constructing grammar based on given rules
- how to find the grammar of this Language?
- ANTLR4 - parse function-like structures in regular text
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- Is this grammar LALR(1)?
- How can I generate a Context Free Grammar for a specific language
- How to auto-complete JSON syntax strings?
- I have a problem in reducing a grammar to LL(1)
Related Questions in COMPUTATION-THEORY
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- Balanced parentheses and brackets, where a closing bracket also closes any outstanding open parentheses (up to the previous open bracket)
- a challenging finite automata - what is the language?
- Optimization - Algorithm for finding load set combination that returns the maximum Von Mises stress
- Unable to create an DPDA that accepts strings in binary notation multiples of 3
- how to find the grammar of this Language?
- Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
- Complexity/decidability of the "nested maze" problem?
- Maximum sum, min length subset
- DFA for all binary strings having even number of 0's or contains exactly two 1's
- Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b
- What is a functional model, sequential model, and concurrent model?
- How to I constract a grammar that generates this language ? (Grammar of type 0)
- What is the flaw in the proof of the countability of the set of finite language?
- Does this DFA satisfy the complement of the given language?
Related Questions in CHOMSKY-NORMAL-FORM
- how to find the grammar of this Language?
- Converting context free grammar to chomsky normal form
- How can I convert a context-free grammar to Chomsky Normal Form (CNF)?
- In converting to chomsky, can i simplify the unit production S->Z of this language?
- How to remove this unit production while converting cfg to cnf
- Stuck in a loop while trying to get Chomsky normal form
- convert context-free-grammar to Chomsky normal form
- Converting a CFG to CNF
- How do I convert to Chomsky Normal Form(CNF)
- Context Free Grammars : How do I terminate the lambda in my non-terminal when it has left recursion?
- Stochastic context-free grammars to Chomsky normal form
- Creating a parse code for Chomsky Normal Form Expansion
- Is it possible for an ambiguous CFG convert into CNF and becomes unambiguous?
- Lambda Expression reduction to NF
- How to deal with loops when converting from context free to CNF?
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: