Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions related to formal languages, grammars, and automata theory
2
votes
Does this constitute as an LL grammar?
An LL grammar is a grammar that can be parsed by an LL parser. An LL parser is a parser which parses input from Left-to-right and constructs a Leftmost derivation of the sentence. (https://en.wikipedi …
0
votes
Accepted
Context-free grammars for two languages
I'm also in a position of still learning (in fact I'm currently taking a Theory of Computation course at school), and I used to have the same problem as you.
The tip that I taught myself and always t …
1
vote
0
answers
506
views
Proving a language is not context-free using the pumping lemma
I had a question regarding the use of the pumping lemma for a particular language I came across. I feel like I have almost solved it, but have gotten stuck on the last steps and wanted some advice. He …
2
votes
2
answers
6k
views
Why is this grammar an LL(2) grammar?
I had a question regarding LL($k$) grammars. I came across a problem that I attempted to solve, but my answer varied from the solution and I wasn't sure why.
$$L = \{a^{n + 2}b^mc^{n + m}\ :\ n \ge 1 …
6
votes
2
answers
2k
views
Why is the start symbol "not allowed" on the right hand side in Chomsky normal form?
I had a question regarding CNF (Chomsky normal form) in formal language theory.
I noticed that a lot of authors (including my own professor, and the Wikipedia page for CNF) frown upon or don't allow …