cpg-analysis/de.fraunhofer.aisec.cpg.analysis.fsm/DFA

DFA

class DFA : Cloneable

A representation of a deterministic finite automaton (DFA).

Constructors

fun DFA()

Types

object Companion

Functions

fun addEdge( from: State, to: State, op: String, base: String?): Boolean

Creates an edge between two nodes with a given label (operator and optional base).

fun addState(isStart: Boolean = false, isAcceptingState: Boolean = false): State

Generates a new state and adds it to this FSM.

open override fun clone(): DFA

Copies the FSM to enable multiple independent branches of execution.

open operator override fun equals(other: Any?): Boolean

fun isAccepted(): Boolean

Checks if the FSM is currently in an accepting state.

makeTransitionWithOp

fun makeTransitionWithOp(op: String, node: Node): Boolean

Checks if the transition with operator op is possible from the current state of the FSM. If so, it updates the state of the FSM and returns true. If no transition is possible, returns false. Collects the old state, the edge and the cpg node in the executionTrace

fun toDotString(): String

Generates the string representing this FSM in DOT format. This allows a simple visualization of the resulting automaton.

Properties

var currentState: State? = null

var executionTrace: MutableList<Triple<State, Node, BaseOpEdge>>

var states: MutableSet<State>