Enum erg_parser::token::TokenKind

#[repr(u8)]
pub enum TokenKind {
    Symbol,
    NatLit,
    IntLit,
    RatioLit,
    BoolLit,
    StrLit,
    StrInterpLeft,
    StrInterpMid,
    StrInterpRight,
    NoneLit,
    NoImplLit,
    EllipsisLit,
    InfLit,
    DocComment,
    PrePlus,
    PreMinus,
    PreBitNot,
    Mutate,
    PreStar,
    PreDblStar,
    Try,
    Plus,
    Minus,
    Star,
    Slash,
    FloorDiv,
    Pow,
    Mod,
    Closed,
    RightOpen,
    LeftOpen,
    Open,
    BitAnd,
    BitOr,
    BitXor,
    Shl,
    Shr,
    Less,
    Gre,
    LessEq,
    GreEq,
    DblEq,
    NotEq,
    InOp,
    NotInOp,
    SubOp,
    IsOp,
    IsNotOp,
    AndOp,
    OrOp,
    DotOp,
    CrossOp,
    RefOp,
    RefMutOp,
    Equal,
    Inclusion,
    Walrus,
    FuncArrow,
    ProcArrow,
    LParen,
    RParen,
    LSqBr,
    RSqBr,
    LBrace,
    RBrace,
    Indent,
    Dedent,
    Dot,
    Pipe,
    Colon,
    DblColon,
    SupertypeOf,
    SubtypeOf,
    Comma,
    Caret,
    Amper,
    AtSign,
    VBar,
    UBar,
    Newline,
    Semi,
    Illegal,
    BOF,
    EOF,
}

意味論的名前と記号自体の名前が混在しているが、Pythonの名残である

Variants

Symbol

e.g. i, p!, $s, T, +, and, ‘d/dx’

NatLit

e.g. 0, 1

IntLit

e.g. -1, -2

RatioLit

BoolLit

StrLit

StrInterpLeft

e.g. “abc{

StrInterpMid

e.g. }abc{

StrInterpRight

e.g. }def“

NoneLit

NoImplLit

EllipsisLit

InfLit

DocComment

PrePlus

+ (unary)

PreMinus

- (unary)

PreBitNot

~ (unary)

Mutate

! (unary)

PreStar

PreDblStar

Try

? (postfix)

Plus

+

Minus

-

Star

*

Slash

/

FloorDiv

//

Pow

**

Mod

%

Closed

..

RightOpen

..<

LeftOpen

<..

Open

<..<

BitAnd

&&

BitOr

||

BitXor

^^

Shl

<<

Shr

Less

<

Gre

LessEq

<=

GreEq

=

DblEq

==

NotEq

!=

InOp

in

NotInOp

notin

SubOp

sub (subtype of)

IsOp

is!

IsNotOp

isnot!

AndOp

and

OrOp

or

DotOp

dot (scalar product)

CrossOp

cross (vector product)

RefOp

ref (special unary)

RefMutOp

ref! (special unary)

Equal

=

Inclusion

<-

Walrus

:=

FuncArrow

->

ProcArrow

=>

LParen

(

RParen

)

LSqBr

[

RSqBr

]

LBrace

{

RBrace

}

Indent

Dedent

Dot

.

Pipe

|>

Colon

:

DblColon

::

SupertypeOf

:>

SubtypeOf

<:

Comma

,

Caret

^

Amper

&

AtSign

@

VBar

|

UBar

_

Newline

\n

Semi

;

Illegal

BOF

Beginning Of File

EOF

Implementations

impl TokenKind

pub const fn category(&self) -> TokenCategory

pub const fn precedence(&self) -> Option<usize>

pub const fn is_right_associative(&self) -> bool

pub const fn is_range_op(&self) -> bool

Trait Implementations

impl Clone for TokenKind

fn clone(&self) -> TokenKind

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TokenKind

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

Formats the value using the given formatter.

impl Display for TokenKind

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

Formats the value using the given formatter.

impl From<TokenKind> for BinOpCode

fn from(tk: TokenKind) -> Self

Converts to this type from the input type.

impl Hash for TokenKind

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<TokenKind> for TokenKind

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for TokenKind

impl Eq for TokenKind

impl StructuralEq for TokenKind

impl StructuralPartialEq for TokenKind