Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package kiama

    Kiama is a Scala library for language processing.

    Kiama is a Scala library for language processing. It is a project of the Programming Languages Research Group at Macquarie University. For full project details see the web site http://kiama.googlecode.com.

    Kiama's main components address tree decoration via attribute grammars (package attribution), tree transformation via strategic term rewriting (package rewriting), dynamic semantics (package machine) and pretty-printing (package output).

    The util package contains support modules for parsing, input/output, read-eval-print loops (REPLs) and pattern matching.

    The examples package (available as part of the Kiama tests) contains many examples of using Kiama to solve small to medium language processing problems.

    Definition Classes
    org
  • package attribution
    Definition Classes
    kiama
  • trait AttributionCore extends AttributionCommon with Memoiser

    Reusable implementation of attribution of syntax trees in a functional style with attribute values cached so that each value is computed at most once.

    Reusable implementation of attribution of syntax trees in a functional style with attribute values cached so that each value is computed at most once.

    Definition Classes
    attribution
  • CachedAttribute
  • CachedDynamicAttribute
  • CachedParamAttribute
  • CircularAttribute
  • ConstantAttribute
  • IdMemoised
  • Memoised
  • MemoisedBase
c

org.kiama.attribution.AttributionCore

CachedDynamicAttribute

class CachedDynamicAttribute[T, U] extends CachedAttribute[T, U]

A cached dynamic attribute of a node type T with value of type U, supported by a memo table and circularity test. The value of the attribute is initially computed by the function f, but the definition can be augmented dynamically. The result is memoised so that it is only evaluated once for a given definition. The attribute definition should not itself require the value of this attribute. If it does, a circularity error is reported by throwing an IllegalStateException. This kind of attribute encapsulates state to keep track of the current definition, so an instance should only be used from one thread at a time.

Source
AttributionCore.scala
Linear Supertypes
CachedAttribute[T, U], AttributionCore.IdMemoised[T, Option[U]], AttributionCore.MemoisedBase[T, Option[U]], Attribute[T, U], (T) ⇒ U, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CachedDynamicAttribute
  2. CachedAttribute
  3. IdMemoised
  4. MemoisedBase
  5. Attribute
  6. Function1
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new CachedDynamicAttribute(name: String, f: (T) ⇒ U)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +=(g: ==>[T, U]): Unit

    Add a new partial function to the definition of this attribute.

    Add a new partial function to the definition of this attribute. Resets the memo table for this attribute.

  4. def -=(g: ==>[T, U]): Unit

    Remove a partial function from the definition of this attribute, if it's there, otherwise have no effect.

    Remove a partial function from the definition of this attribute, if it's there, otherwise have no effect. If g appears more than once in the definition, just remove the first one. Resets the memo table for this attribute.

  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def andThen[A](g: (U) ⇒ A): (T) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  7. def apply(t: T): U

    Return the value of this attribute for node t, raising an error if it depends on itself.

    Return the value of this attribute for node t, raising an error if it depends on itself. IF the value has been memoised, return it. Otherwise, the functions list is tried in order. The first partial function on that list that is defined will be used. If no partial function on this list is defined, then f will be used.

    Definition Classes
    CachedDynamicAttribute → CachedAttribute → Function1
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def block(b: ⇒ Any): Unit

    Execute a block and restore the state of this dynamic attribute after the block has executed.

    Execute a block and restore the state of this dynamic attribute after the block has executed. The idea is that the block can add to the definition of the attribute for use within the block. Any definitions that are added will be automatically removed at the end of the block.

  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def compose[A](g: (A) ⇒ T): (A) ⇒ U
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  12. def dup(t1: T, t2: T, u: Option[U]): Unit

    Duplicate an entry if possible.

    Duplicate an entry if possible. If t1 has a memoised value associated with it, set the value associated with t2 to the same value. If there is no value associated with t1, set the value associated with t2 to u.

    Definition Classes
    MemoisedBase
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. val functions: ListBuffer[PartialFunction[T, U]]

    List of functions that currently dynamically define this attribute.

  17. def get(t: T): Option[Option[U]]

    Return the value stored at key t as an option.

    Return the value stored at key t as an option.

    Definition Classes
    MemoisedBase
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  19. def getWithDefault(t: T, u: Option[U]): Option[U]

    Return the value stored at key t if there is one, otherwise return u.

    Return the value stored at key t if there is one, otherwise return u.

    Definition Classes
    MemoisedBase
  20. def hasBeenComputedAt(t: T): Boolean

    Has the value of this attribute at t already been computed or not? If the table contains Some (u) then we've computed it and the value was u.

    Has the value of this attribute at t already been computed or not? If the table contains Some (u) then we've computed it and the value was u. If the memo table contains None we are in the middle of computing it. Otherwise the memo table contains no entry for t.

    Definition Classes
    CachedAttribute → MemoisedBase
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. val memo: Cache[AnyRef, AnyRef]

    The memo table.

    The memo table.

    Definition Classes
    IdMemoised → MemoisedBase
  24. val name: String
    Definition Classes
    Attribute
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  28. def put(t: T, u: Option[U]): Unit

    Store the value u under the key t.

    Store the value u under the key t.

    Definition Classes
    MemoisedBase
  29. def putIfNotPresent(t: T, u: Option[U]): Unit

    Store the value u under the key t if t does not already have an associated value.

    Store the value u under the key t if t does not already have an associated value.

    Definition Classes
    MemoisedBase
  30. def reportCycle(t: T): U

    Report a cycle in the calculation of this attribute discovered when evaluating the attribute on value t.

    Report a cycle in the calculation of this attribute discovered when evaluating the attribute on value t. Throws an IllegalStateException.

    Definition Classes
    Attribute
  31. def reset(): Unit

    Immediately reset the memo table.

    Immediately reset the memo table.

    Definition Classes
    MemoisedBase
  32. def resetAt(t: T): Unit

    Immediately reset the memo table at t.

    Immediately reset the memo table at t.

    Definition Classes
    MemoisedBase
  33. def resetIfRequested(): Unit

    Check to see if a reset has been requested via the common memo version, and if so, do it.

    Check to see if a reset has been requested via the common memo version, and if so, do it.

    Definition Classes
    MemoisedBase
  34. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  35. def toString(): String

    The attribute's string representation is its name.

    The attribute's string representation is its name.

    Definition Classes
    Attribute → Function1 → AnyRef → Any
  36. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from CachedAttribute[T, U]

Inherited from AttributionCore.IdMemoised[T, Option[U]]

Inherited from AttributionCore.MemoisedBase[T, Option[U]]

Inherited from Attribute[T, U]

Inherited from (T) ⇒ U

Inherited from AnyRef

Inherited from Any

Ungrouped