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 context-free
Search options not deleted
user 9397
Questions about the set of languages (equivalently) described by context-free grammars or accepted by (non-deterministic) pushdown automata.
0
votes
1
answer
80
views
Formal proof of existence of equivalent parse tree for each derivation
Where I can find formal proof of there exists an equivalent parse tree for each derivation? There is a lot of informal proof of equivalency on the internet but I need formal proof to reference it in a …
- 151
0
votes
Accepted
Formal proof of existence of equivalent parse tree for each derivation
Proposition 6.11
Full manuscript: https://www.cis.upenn.edu/~jean/gbooks/tocnotes.html
Definition 3.11.2: Given a context-free grammar $G = (V, \Sigma, P,
> S)$, for any $A \in N$, if $\pi: A \stackr …
- 151