Packages

o

info.kwarc.mmt.mizar.reader

ArticleParser

object ArticleParser

Source
Article.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArticleParser
  2. AnyRef
  3. 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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. def parseArticle(n: Node): Unit

    parseArticle Format: Article

    parseArticle Format: Article

    n

    the entire article

  16. def parseArticleChildren(n: Node): Unit

    parseArticleChildren Format:

    parseArticleChildren Format:

    n

    a child of article

  17. def parseDefMeaning(n: Node): (Option[(List[(MizTerm, MizFormula)], Option[MizTerm])], Option[(List[(MizFormula, MizFormula)], Option[MizFormula])])
  18. def parseDefTheorem(n: Node): Unit

    parseDefTheorem Format: Proposition;

    parseDefTheorem Format: Proposition;

    n

    the node being parsed

    returns

    the translated node

  19. def parseDefiniens(n: Node): Unit

    parseDefiniens Format: Typ*, Essentials, Formula, ? DefMeaning

    parseDefiniens Format: Typ*, Essentials, Formula, ? DefMeaning

    n

    the node being parsed

    returns

    the translated node

  20. def parseDefinitionBlock(n: Node, defBlockNr: Int): Unit

    parseDefinitionBlock Format:

    parseDefinitionBlock Format:

    n

    the node being parsed

    returns

    the translated node

  21. def parseJustifiedTheorem(n: Node): Unit

    parseJustifiedTheorem Format: JustifiedTheorem -> (Proposition, Justification)

    parseJustifiedTheorem Format: JustifiedTheorem -> (Proposition, Justification)

    n

    the node being parsed

    returns

    the translated node

  22. def parseLemma(n: Node): Unit
  23. def parseNotationBlock(n: Node): Unit
  24. def parseNotationPattern(n: Node): MizNotation
  25. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped