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 | |
Results tagged with formal-languages
Search options not deleted
user 54953
Questions related to formal languages, grammars, and automata theory
1
vote
1
answer
40
views
Detect (indirect) left-recursion in a context-free grammar?
Given a context-free grammar:
A -> α0 | α1 | ...
B -> β0 | β1 | ...
...
It's straightforward to determine whether the grammar is directly left-recursive - it is, if any of the αi begin with A, or any …
- 151
0
votes
2
answers
29
views
Does a language recognizer require an unambiguous context-free grammar?
The reference manual for Lua contains a complete EBNF grammar for the language. However, it's simplified compared to the grammar used by the actual Lua parser.
In particular, the simplified grammar is …
- 151
3
votes
0
answers
121
views
Convert a regular expression to a *minimal* LL(1) regular grammar
Given a regular language defined by a regular expression, we can convert it to an NFA, which is equivalent to a right-regular grammar. The grammar is not generally LL(1).
However, if we convert the NF …
- 151