Skip to content
Browse files

Update for changes to Leo logic

  • Loading branch information...
1 parent ce205a0 commit 1d8d4002917f89c2977f049d9a2bd0e3bb5e222a Jeffrey Kegler committed Jun 19, 2013
Showing with 20 additions and 10 deletions.
  1. +20 −10 recce.ltx
30 recce.ltx
@@ -2909,27 +2909,37 @@ and by Theorem \ref{t:tries-O-eims},
so that
$\var{other-tries} = \order{\var{n}^2}$.
-Reconsidering \var{reduction-tries}
+Looking again at \var{reduction-tries}
for the case of ambiguous grammars,
we need to look again at the triple
-[\Veim{predecessor}, \Vloc{component-origin}, \Vsym{transition}].
+[\Veim{predecessor}, \Vsym{transition}, \Veim{component}].
-For unambiguous grammars we could assume that the relationship
-of \Veim{predecessor} to \Vloc{component-origin} was one-to-one,
-but in an unambiguous grammar we must allow it to be many-to-one.
+We did not use the fact that the grammar was unambigous in counting
+the possibilities for \Vsym{transition} or \Veim{component}, but
+we did make use of it in determining the count of possibilities
+for \Veim{predecessor}.
+We know still know that
+\Veim{predecessor} \in \Ves{component-origin},
+\Vloc{component-origin} is the origin of \Veim{component}.
Worst case, every EIM in \Ves{component-origin} is a possible
-match, so that the number of possible combinations is
+match, so that
+the number of possibilities for \Veim{predecessor} now grows to
+\size{\Ves{component-origin}}, and
-\bigsize{\Vtable{component-origin}} \times \Vsize{symbols} \times \bigsize{\Vtable{j}}.
+\var{reduction-tries} =
+\bigsize{\Ves{component-origin}} \times \Vsize{symbols} \times \bigsize{\Ves{j}}.
In the worst case $\var{component-origin} \simeq \var{j}$,
so that by Theorem \ref{t:es-count},
-\times \bigsize{\EVtable{\Marpa}{j}} = \order{\var{j}^2}
+\size{\Ves{component-origin}} \times \size{\Ves{j}} = \order{\var{j}^2}.
Adding \var{other-tries}
and summing over the Earley sets,

0 comments on commit 1d8d400

Please sign in to comment.
Something went wrong with that request. Please try again.