Enum Token 

pub enum Token {
    Or,
    Nor,
    Xor,
    NodeStart,
    NodeEnd,
    InputDecl,
    OutputDecl,
    True,
    False,
    Id(u16),
}

TØR-G token vocabulary - closed, finite set.

These tokens are the atomic units of the IR. An LLM constrained to emit only valid tokens at each step (via logit masking) will produce syntactically correct boolean circuits.

Variants

Or

Logical OR: A ∨ B

Nor

Logical NOR: ¬(A ∨ B)

Xor

Logical XOR: A ⊕ B

NodeStart

Begin node definition: ●

NodeEnd

End node definition: ○

InputDecl

Declare external input: ◎IN

OutputDecl

Mark as graph output: ◎OUT

True

Constant true: ◎T

False

Constant false: ◎F

Id(u16)

Identifier (0..65535)

Implementations

impl Token

pub fn as_bool_op(&self) -> Option<BoolOp>

Convert to BoolOp if this is an operator token.

pub fn is_operator(&self) -> bool

Check if this is an operator token.

pub fn as_source(&self) -> Option<Source>

Convert to Source if this can be a source operand.

Trait Implementations

impl Clone for Token

fn clone(&self) -> Token

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Token

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Token

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Token

fn eq(&self, other: &Token) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Token

impl Eq for Token

impl StructuralPartialEq for Token