object Loner
LL(1) computer
Applicable to org.benknoble.ebnf.Grammar instances
- Annotations
- @JSExportTopLevel( "Loner" )
- Alphabetic
- By Inheritance
- Loner
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
Followers = Map[Nonterminal, Set[Word]]
Type of the follower computation
Type of the follower computation
Map from org.benknoble.ebnf.Nonterminal to Set[Word]
-
type
NtMap[A] = Map[Nonterminal, A]
Map from org.benknoble.ebnf.Nonterminal to 'A'
-
type
Nullables = Map[Nonterminal, Boolean]
Type of the nullable computation
Type of the nullable computation
Map from org.benknoble.ebnf.Nonterminal to Boolean
-
type
Starters = Map[Nonterminal, Set[Word]]
Type of the starter computation
Type of the starter computation
Map from org.benknoble.ebnf.Nonterminal to Set[Word]
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(g: Grammar): Boolean
equivalent to Loner.isLLone(g)
-
def
areDisjoint[A](sets: Set[A]*): Boolean
true iff all sets are mutually disjoint
true iff all sets are mutually disjoint
Equivalent to ∩(sets) == ∅
- sets
the sets to test
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fix[A, B](fi: (A, B) ⇒ B)(f0: B): (A) ⇒ B
Returns a function which computes the least fixed point, given a starting value and a step function
Returns a function which computes the least fixed point, given a starting value and a step function
- fi
step function
- f0
start value
-
def
followers(g: Grammar): Followers
Computes follower map of an org.benknoble.ebnf.Grammar
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isLLone(g: Grammar): Boolean
true iff the org.benknoble.ebnf.Gramamr is in LL(1)
true iff the org.benknoble.ebnf.Gramamr is in LL(1)
- Annotations
- @JSExport()
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
nullable(g: Grammar): Nullables
Computes nullable map of an org.benknoble.ebnf.Grammar
-
def
starters(g: Grammar): Starters
Computes starter map of an org.benknoble.ebnf.Grammar
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
⊙: SetFilter[Word]
The monoid operation on Set[Word] defined by org.benknoble.loner.SetFilter
The monoid operation on Set[Word] defined by org.benknoble.loner.SetFilter
⊙(S)(T) = if (S contains ε) (S - ε) union T else S