commonMain.org.antlr.v4.kotlinruntime.atn.PredictionContext.kt Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of antlr-kotlin-runtime-js Show documentation
Show all versions of antlr-kotlin-runtime-js Show documentation
Kotlin multiplatform port of ANTLR
The newest version!
/*
* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
* Use of this file is governed by the BSD 3-clause license that
* can be found in the LICENSE.txt file in the project root.
*/
package org.antlr.v4.kotlinruntime.atn
import com.strumenta.kotlinmultiplatform.IdentityHashMap
import com.strumenta.kotlinmultiplatform.assert
import org.antlr.v4.kotlinruntime.EMPTY_RULECTX
import org.antlr.v4.kotlinruntime.Recognizer
import org.antlr.v4.kotlinruntime.RuleContext
import org.antlr.v4.kotlinruntime.misc.DoubleKeyMap
import org.antlr.v4.kotlinruntime.misc.MurmurHash
abstract class PredictionContext protected constructor(
/**
* Stores the computed hash code of this [PredictionContext]. The hash
* code is computed in parts to match the following reference algorithm.
*
*
* private int referenceHashCode() {
* int hash = [MurmurHash.initialize]([.INITIAL_HASH]);
*
* for (int i = 0; i < [.size]; i++) {
* hash = [MurmurHash.update](hash, [getParent][.getParent](i));
* }
*
* for (int i = 0; i < [.size]; i++) {
* hash = [MurmurHash.update](hash, [getReturnState][.getReturnState](i));
* }
*
* hash = [MurmurHash.finish](hash, 2 * [.size]);
* return hash;
* }
*
*/
val cachedHashCode: Int
) {
/** This means only the [.EMPTY] (wildcard? not sure) context is in set. */
open val isEmpty: Boolean
get() = this === EMPTY
abstract fun size(): Int
abstract fun getParent(index: Int): PredictionContext?
abstract fun getReturnState(index: Int): Int
fun hasEmptyPath(): Boolean {
// since EMPTY_RETURN_STATE can only appear in the last position, we check last one
return getReturnState(size() - 1) == EMPTY_RETURN_STATE
}
override fun hashCode(): Int {
return cachedHashCode
}
abstract override fun equals(other: Any?): Boolean
fun toString(recog: Recognizer<*, *>): String {
return toString()
// return toString(recog, ParserRuleContext.EMPTY);
}
fun toStrings(recognizer: Recognizer<*, *>, currentState: Int): Array {
return toStrings(recognizer, EMPTY, currentState)
}
// FROM SAM
fun toStrings(recognizer: Recognizer<*, *>?, stop: PredictionContext, currentState: Int): Array {
val result = ArrayList()
var perm = 0
outer@ while (true) {
var offset = 0
var last = true
var p: PredictionContext? = this
var stateNumber = currentState
val localBuffer = StringBuilder()
localBuffer.append("[")
while (!p!!.isEmpty && p !== stop) {
var index = 0
if (p.size() > 0) {
var bits = 1
while (1 shl bits < p.size()) {
bits++
}
val mask = (1 shl bits) - 1
index = perm shr offset and mask
last = last and (index >= p.size() - 1)
if (index >= p.size()) {
perm++
continue@outer
}
offset += bits
}
if (recognizer != null) {
if (localBuffer.length > 1) {
// first char is '[', if more than that this isn't the first rule
localBuffer.append(' ')
}
val atn = recognizer.atn
val s = atn.states[stateNumber]
val ruleName = recognizer.ruleNames!![s!!.ruleIndex]
localBuffer.append(ruleName)
} else if (p.getReturnState(index) != EMPTY_RETURN_STATE) {
if (!p.isEmpty) {
if (localBuffer.length > 1) {
// first char is '[', if more than that this isn't the first rule
localBuffer.append(' ')
}
localBuffer.append(p.getReturnState(index))
}
}
stateNumber = p.getReturnState(index)
p = p.getParent(index)
}
localBuffer.append("]")
result.add(localBuffer.toString())
if (last) {
break
}
perm++
}
return result.toTypedArray()
}
companion object {
/**
* Represents `$` in local context prediction, which means wildcard.
* `*+x = *`.
*/
val EMPTY = EmptyPredictionContext()
/**
* Represents `$` in an array in full context mode, when `$`
* doesn't mean wildcard: `$ + x = [$,x]`. Here,
* `$` = [.EMPTY_RETURN_STATE].
*/
val EMPTY_RETURN_STATE = Int.MAX_VALUE
private val INITIAL_HASH = 1
/** Convert a [RuleContext] tree to a [PredictionContext] graph.
* Return [.EMPTY] if `outerContext` is empty or null.
*/
fun fromRuleContext(atn: ATN, outerContext: RuleContext?): PredictionContext {
val outerContext1 = outerContext ?: EMPTY_RULECTX
// if we are in RuleContext of start rule, s, then PredictionContext
// is EMPTY. Nobody called us. (if we are empty, return empty)
if (outerContext1.readParent() == null || outerContext1 === EMPTY_RULECTX) {
return EMPTY
}
// If we have a parent, convert it to a PredictionContext graph
val parent = fromRuleContext(atn, outerContext1.readParent())
val state = atn.states[outerContext1.invokingState]
val transition = state!!.transition(0) as RuleTransition
return SingletonPredictionContext.create(parent, transition.followState.stateNumber)
}
fun calculateEmptyHashCode(): Int {
var hash = MurmurHash.initialize(INITIAL_HASH)
hash = MurmurHash.finish(hash, 0)
return hash
}
fun calculateHashCode(parent: PredictionContext, returnState: Int): Int {
var hash = MurmurHash.initialize(INITIAL_HASH)
hash = MurmurHash.update(hash, parent)
hash = MurmurHash.update(hash, returnState)
hash = MurmurHash.finish(hash, 2)
return hash
}
fun calculateHashCode(parents: Array, returnStates: IntArray): Int {
var hash = MurmurHash.initialize(INITIAL_HASH)
for (parent in parents) {
hash = MurmurHash.update(hash, parent)
}
for (returnState in returnStates) {
hash = MurmurHash.update(hash, returnState)
}
hash = MurmurHash.finish(hash, 2 * parents.size)
return hash
}
// dispatch
fun merge(
a: PredictionContext?, b: PredictionContext?,
rootIsWildcard: Boolean,
mergeCache: DoubleKeyMap?
): PredictionContext {
var a1 = a
var b1 = b
assert(a1 != null && b1 != null) // must be empty context, never null
// share same graph if both same
if (a1 === b1 || a1 == b1) return a1!!
if (a1 is SingletonPredictionContext && b1 is SingletonPredictionContext) {
return mergeSingletons(
a1 as SingletonPredictionContext,
b1 as SingletonPredictionContext,
rootIsWildcard, mergeCache
)
}
// At least one of a or b is array
// If one is $ and rootIsWildcard, return $ as * wildcard
if (rootIsWildcard) {
if (a1 is EmptyPredictionContext) return a1
if (b1 is EmptyPredictionContext) return b1
}
// convert singleton so both are arrays to normalize
if (a1 is SingletonPredictionContext) {
a1 = ArrayPredictionContext(a1)
}
if (b1 is SingletonPredictionContext) {
b1 = ArrayPredictionContext((b1 as SingletonPredictionContext?)!!)
}
return mergeArrays(
a1 as ArrayPredictionContext, b1 as ArrayPredictionContext,
rootIsWildcard, mergeCache
)
}
/**
* Merge two [SingletonPredictionContext] instances.
*
*
* Stack tops equal, parents merge is same; return left graph.
*
*
*
* Same stack top, parents differ; merge parents giving array node, then
* remainders of those graphs. A new root node is created to point to the
* merged parents.
*
*
*
* Different stack tops pointing to same parent. Make array node for the
* root where both element in the root point to the same (original)
* parent.
*
*
*
* Different stack tops pointing to different parents. Make array node for
* the root where each element points to the corresponding original
* parent.
*
*
* @param a the first [SingletonPredictionContext]
* @param b the second [SingletonPredictionContext]
* @param rootIsWildcard `true` if this is a local-context merge,
* otherwise false to indicate a full-context merge
* @param mergeCache
*/
fun mergeSingletons(
a: SingletonPredictionContext,
b: SingletonPredictionContext,
rootIsWildcard: Boolean,
mergeCache: DoubleKeyMap?
): PredictionContext {
if (mergeCache != null) {
var previous = mergeCache[a, b]
if (previous != null) return previous
previous = mergeCache[b, a]
if (previous != null) return previous
}
val rootMerge = mergeRoot(a, b, rootIsWildcard)
if (rootMerge != null) {
mergeCache?.put(a, b, rootMerge)
return rootMerge
}
if (a.returnState == b.returnState) { // a == b
val parent = merge(a.parent, b.parent, rootIsWildcard, mergeCache)
// if parent is same as existing a or b parent or reduced to a parent, return it
if (parent === a.parent) return a // ax + bx = ax, if a=b
if (parent === b.parent) return b // ax + bx = bx, if a=b
// else: ax + ay = a'[x,y]
// merge parents x and y, giving array node with x,y then remainders
// of those graphs. dup a, a' points at merged array
// new joined parent so create new singleton pointing to it, a'
val c = SingletonPredictionContext.create(parent, a.returnState)
mergeCache?.put(a, b, c)
return c
} else { // a != b payloads differ
// see if we can collapse parents due to $+x parents if local ctx
var singleParent: PredictionContext? = null
if (a === b || a.parent != null && a.parent == b.parent) { // ax + bx = [a,b]x
singleParent = a.parent
}
if (singleParent != null) { // parents are same
// sort payloads and use same parent
val payloads = intArrayOf(a.returnState, b.returnState)
if (a.returnState > b.returnState) {
payloads[0] = b.returnState
payloads[1] = a.returnState
}
val parents: Array = arrayOf(singleParent, singleParent)
val a_ = ArrayPredictionContext(parents!!, payloads)
if (mergeCache != null) mergeCache!!.put(a, b, a_)
return a_
}
// parents differ and can't merge them. Just pack together
// into array; can't merge.
// ax + by = [ax,by]
val payloads = intArrayOf(a.returnState, b.returnState)
var parents = arrayOf(a.parent, b.parent)
if (a.returnState > b.returnState) { // sort by payload
payloads[0] = b.returnState
payloads[1] = a.returnState
parents = arrayOf(b.parent, a.parent)
}
val a_ = ArrayPredictionContext(parents, payloads)
if (mergeCache != null) mergeCache!!.put(a, b, a_)
return a_
}
}
/**
* Handle case where at least one of `a` or `b` is
* [.EMPTY]. In the following diagrams, the symbol `$` is used
* to represent [.EMPTY].
*
* Local-Context Merges
*
*
* These local-context merge operations are used when `rootIsWildcard`
* is true.
*
*
* [.EMPTY] is superset of any graph; return [.EMPTY].
*
*
*
* [.EMPTY] and anything is `#EMPTY`, so merged parent is
* `#EMPTY`; return left graph.
*
*
*
* Special case of last merge if local context.
*
*
* Full-Context Merges
*
*
* These full-context merge operations are used when `rootIsWildcard`
* is false.
*
*
*
*
*
* Must keep all contexts; [.EMPTY] in array is a special value (and
* null parent).
*
*
*
*
*
* @param a the first [SingletonPredictionContext]
* @param b the second [SingletonPredictionContext]
* @param rootIsWildcard `true` if this is a local-context merge,
* otherwise false to indicate a full-context merge
*/
fun mergeRoot(
a: SingletonPredictionContext,
b: SingletonPredictionContext,
rootIsWildcard: Boolean
): PredictionContext? {
if (rootIsWildcard) {
if (a === EMPTY) return EMPTY // * + b = *
if (b === EMPTY) return EMPTY // a + * = *
} else {
if (a === EMPTY && b === EMPTY) return EMPTY // $ + $ = $
if (a === EMPTY) { // $ + x = [x,$]
val payloads = intArrayOf(b.returnState, EMPTY_RETURN_STATE)
val parents = arrayOf(b.parent, null)
return ArrayPredictionContext(parents, payloads)
}
if (b === EMPTY) { // x + $ = [x,$] ($ is always last if present)
val payloads = intArrayOf(a.returnState, EMPTY_RETURN_STATE)
val parents = arrayOf(a.parent, null)
return ArrayPredictionContext(parents, payloads)
}
}
return null
}
/**
* Merge two [ArrayPredictionContext] instances.
*
*
* Different tops, different parents.
*
*
*
* Shared top, same parents.
*
*
*
* Shared top, different parents.
*
*
*
* Shared top, all shared parents.
*
*
*
* Equal tops, merge parents and reduce top to
* [SingletonPredictionContext].
*
*/
fun mergeArrays(
a: ArrayPredictionContext,
b: ArrayPredictionContext,
rootIsWildcard: Boolean,
mergeCache: DoubleKeyMap?
): PredictionContext {
if (mergeCache != null) {
var previous = mergeCache!!.get(a, b)
if (previous != null) return previous
previous = mergeCache!!.get(b, a)
if (previous != null) return previous
}
// merge sorted payloads a + b => M
var i = 0 // walks a
var j = 0 // walks b
var k = 0 // walks target M array
var mergedReturnStates = IntArray(a.returnStates!!.size + b.returnStates!!.size)
var mergedParents = arrayOfNulls(a.returnStates!!.size + b.returnStates.size)
// walk and merge to yield mergedParents, mergedReturnStates
while (i < a.returnStates!!.size && j < b.returnStates!!.size) {
val a_parent = a.parents!![i]
val b_parent = b.parents!![j]
if (a.returnStates[i] == b.returnStates!![j]) {
// same payload (stack tops are equal), must yield merged singleton
val payload = a.returnStates[i]
// $+$ = $
val `both$` = payload == EMPTY_RETURN_STATE &&
a_parent == null && b_parent == null
val ax_ax = a_parent != null && b_parent != null && a_parent == b_parent // ax+ax -> ax
if (`both$` || ax_ax) {
mergedParents[k] = a_parent // choose left
mergedReturnStates[k] = payload
} else { // ax+ay -> a'[x,y]
val mergedParent = merge(a_parent, b_parent, rootIsWildcard, mergeCache)
mergedParents[k] = mergedParent
mergedReturnStates[k] = payload
}
i++ // hop over left one as usual
j++ // but also skip one in right side since we merge
} else if (a.returnStates[i] < b.returnStates[j]) { // copy a[i] to M
mergedParents[k] = a_parent
mergedReturnStates[k] = a.returnStates[i]
i++
} else { // b > a, copy b[j] to M
mergedParents[k] = b_parent
mergedReturnStates[k] = b.returnStates[j]
j++
}
k++
}
// copy over any payloads remaining in either array
if (i < a.returnStates.size) {
for (p in i until a.returnStates.size) {
mergedParents[k] = a.parents!![p]
mergedReturnStates[k] = a.returnStates[p]
k++
}
} else {
for (p in j until b.returnStates.size) {
mergedParents[k] = b.parents!![p]
mergedReturnStates[k] = b.returnStates[p]
k++
}
}
// trim merged if we combined a few that had same stack tops
if (k < mergedParents.size) { // write index < last position; trim
if (k == 1) { // for just one merged element, return singleton top
val a_ = SingletonPredictionContext.create(
mergedParents[0],
mergedReturnStates[0]
)
mergeCache?.put(a, b, a_)
return a_
}
mergedParents = mergedParents.copyOf(k)
mergedReturnStates = mergedReturnStates.copyOf(k)
}
val M = ArrayPredictionContext(mergedParents, mergedReturnStates)
// if we created same array as a or b, return that instead
// TODO: track whether this is possible above during merge sort for speed
if (M == a) {
mergeCache?.put(a, b, a)
return a
}
if (M == b) {
mergeCache?.put(a, b, b)
return b
}
//TODO efficiency
combineCommonParents(mergedParents.filterNotNull().toTypedArray())
mergeCache?.put(a, b, M)
return M
}
/**
* Make pass over all *M* `parents`; merge any `equals()`
* ones.
*/
protected fun combineCommonParents(parents: Array) {
val uniqueParents = HashMap()
for (p in parents.indices) {
val parent = parents[p]
if (!uniqueParents.containsKey(parent)) { // don't replace
uniqueParents[parent] = parent
}
}
for (p in parents.indices) {
parents[p] = uniqueParents[parents[p]]!!
}
}
// From Sam
fun getCachedContext(
context: PredictionContext,
contextCache: PredictionContextCache,
visited: IdentityHashMap
): PredictionContext {
if (context.isEmpty) {
return context
}
var existing: PredictionContext? = visited[context]
if (existing != null) {
return existing
}
existing = contextCache.get(context)
if (existing != null) {
visited.put(context, existing)
return existing
}
var changed = false
var parents = arrayOfNulls(context.size())
for (i in parents.indices) {
val parent = getCachedContext(context.getParent(i)!!, contextCache, visited)
if (changed || parent !== context.getParent(i)) {
if (!changed) {
parents = arrayOfNulls(context.size())
for (j in 0 until context.size()) {
parents[j] = context.getParent(j)
}
changed = true
}
parents[i] = parent
}
}
if (!changed) {
contextCache.add(context)
visited.put(context, context)
return context
}
val updated: PredictionContext
if (parents.size == 0) {
updated = EMPTY
} else if (parents.size == 1) {
updated = SingletonPredictionContext.create(parents[0], context.getReturnState(0))
} else {
val arrayPredictionContext = context as ArrayPredictionContext
updated = ArrayPredictionContext(parents, arrayPredictionContext.returnStates)
}
contextCache.add(updated)
visited.put(updated, updated)
visited.put(context, updated)
return updated
}
// // extra structures, but cut/paste/morphed works, so leave it.
// // seems to do a breadth-first walk
// public static List getAllNodes(PredictionContext context) {
// Map visited =
// new IdentityHashMap();
// Deque workList = new ArrayDeque();
// workList.add(context);
// visited.put(context, context);
// List nodes = new ArrayList();
// while (!workList.isEmpty()) {
// PredictionContext current = workList.pop();
// nodes.add(current);
// for (int i = 0; i < current.size(); i++) {
// PredictionContext parent = current.getParent(i);
// if ( parent!=null && visited.put(parent, parent) == null) {
// workList.push(parent);
// }
// }
// }
// return nodes;
// }
// ter's recursive version of Sam's getAllNodes()
fun getAllContextNodes(context: PredictionContext): List {
val nodes = ArrayList()
val visited = IdentityHashMap()
getAllContextNodes_(context, nodes, visited)
return nodes
}
fun getAllContextNodes_(
context: PredictionContext?,
nodes: MutableList,
visited: MutableMap
) {
if (context == null || visited.containsKey(context)) return
visited.put(context, context)
nodes.add(context)
for (i in 0 until context.size()) {
getAllContextNodes_(context.getParent(i), nodes, visited)
}
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy