o

at.logic.gapt.grammars

SipRecSchem

object SipRecSchem extends RecSchemTemplate

Source
recursionSchemes.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SipRecSchem
  2. RecSchemTemplate
  3. Serializable
  4. Serializable
  5. Product
  6. Equals
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val A: String
  5. val G: String
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. val canonicalArgs: Map[Const, List[Var]]
    Definition Classes
    RecSchemTemplate
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. val constraintEvaluators: Map[(Const, Const), (Seq[Expr], Seq[Expr]) ⇒ Boolean]
    Definition Classes
    RecSchemTemplate
  10. val constraints: Map[(Const, Const), Formula]
    Definition Classes
    RecSchemTemplate
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def findMinimalCover(targets: Set[(Expr, Expr)], solver: MaxSATSolver = bestAvailableMaxSatSolver, weight: (Rule) ⇒ Int = _ => 1): RecursionScheme
    Definition Classes
    RecSchemTemplate
  14. def findMinimalCoverViaInst(targets: Set[(Expr, Expr)], solver: MaxSATSolver = bestAvailableMaxSatSolver, weight: (Rule) ⇒ Int = _ => 1): RecursionScheme
    Definition Classes
    RecSchemTemplate
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def isSubterm(v: Expr, t: Expr): Formula
    Definition Classes
    RecSchemTemplate
  18. val isSubtermC: String
    Definition Classes
    RecSchemTemplate
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. val nonTerminals: Set[Const]
    Definition Classes
    RecSchemTemplate
  21. final def notify(): Unit
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  23. def stableRecSchem(instanceLanguages: Seq[InstanceLanguage]): RecursionScheme
  24. def stableRecSchem(targets: Set[(Expr, Expr)]): RecursionScheme
    Definition Classes
    RecSchemTemplate
  25. val startSymbol: Const
    Definition Classes
    RecSchemTemplate
  26. val states: Iterable[Expr]
    Definition Classes
    RecSchemTemplate
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. val targetFilter: Type
    Definition Classes
    RecSchemTemplate
  29. val template: Set[(Expr, Expr)]
    Definition Classes
    RecSchemTemplate
  30. def toSipGrammar(recSchem: RecursionScheme): SipGrammar
  31. def toTargets(instanceLanguages: Seq[InstanceLanguage]): Seq[(Expr, Expr)]
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from RecSchemTemplate

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped