. Answers to this question are eligible for a +500 reputation bounty. t ...
. Answers to this question are eligible for a +500 reputation bounty. t ...
Is there a general algorithm that turns a given grammar into LR(0) grammar? I tried turning the grammar into CNF but even when I succeeded it didnt w ...
The given language is: B = { aibic2m | i ≥ 0, m ≥ 0 } ∪ { arbsc2t | r ≥ 4, s ≥ 4, t ≥ 0} My Prof has provided a regular expression for this language ...
I want a pda for this language L = (a|b)* - {wwR : W is in {a,b}*} ...
On the Wikipedia page of Finite State Machines it shows a graphic of the automata types: I've never heard of combinational logic being included in ...
What does the following mean in the JSON rfc? I assume 1*DIGIT means "One or more digits", but why that particular notation, why not as \d+ or DIGI ...
I need help defining some rules for a grammar in cups. The rules in question belong to the declaration block, which consists of the declaration of 0 o ...
How to construct unrestricted grammar that generates L = {a^ib^j c^k^d^l : i not equal to k AND j not equal to l}. a is to the power of i, 'b' raised ...
I'm getting back into language design/specification (via BNF/EBNF grammars) after 20+ years of leaving the topic alone (since my CS undergrad degree). ...
I'm writing an extended mathematical expression evaluator. It is supposed to allow defining macros in the form: I'm using Irony to break the expres ...
I am having problems with a grammer I am using to make a CUP Parser. The grammer is as follows: In CUP format. Or written out: My main problem r ...
In the grammar I have a rule "D → bD | D". How do I remove unit production from this rule for converting it to cnf? The grammar is this: ...
There have been similar questions, like this or this, but mine is different: Let's say, I have a probabilistic context-free grammar (PCFG) where e ...
I want to find Context Free Grammar for L={ a^n b^m : n <= m+3 , n,m>=0} What I have so far Does this make any sense? ...
Let's focus on the following parts with the following assumptions, any identifier having an Uppercase initial character is a Terminal (Misc, CharD ...
I refer to this link for the following grammar, Obviously, we can produce elements (like, <p>hello world</p>) by decomposing elemen ...
I have to classify the language L={aˆjbˆkaˆl | l = j * k}. I applied the pumping lemma for CFL and think that it is not context free. However, to pro ...
I want to write the grammar for a list containing sequentially increasing integers like this I want to use a recursive definition to avoid defining ...
In the section 5.1.5 Grammar Notation of the ECMAScript there is an example of the grammar notation regarding to parameterized productions Referen ...
S→aAa | bBb |€, A→C|a , B→C|b , C→CDE | € , D→A|B|ab In this i think E,C,D are useless but if we remove those, then there is no point in this questio ...