Class Candidate<T>

Candidate for ELR parsers.

Type Parameters

T

Hierarchy

Candidate

Index

Constructors

Properties

digested gr nextMap str?

Accessors

Methods

canDigestMore eq getNext toString tryLex tryReduce getString

Constructors

constructor

new Candidate<T>(data: Pick<Candidate<T>, "digested" | "gr">): Candidate<T>
Type Parameters
- T
Parameters
- data: Pick<Candidate<T>, "digested" | "gr">
Returns Candidate<T>
- Defined in src/parser/ELR/DFA/candidate.ts:26

Properties

`Readonly` digested

digested: number

How many grammars are already matched in this.gr.

`Readonly` gr

gr: Readonly<GrammarRule<T>>

`Protected` `Readonly` nextMap

nextMap: Map<string, null | Candidate<T>>

ast node str => candidate. This will be calculated during DFA.calculateAllStates.

`Private` `Optional` str

str?: string

Cache the string representation.

Accessors

current

get current(): Grammar
Current grammar.

Returns Grammar
- Defined in src/parser/ELR/DFA/candidate.ts:32

Methods

canDigestMore

canDigestMore(): boolean
Returns boolean
- Defined in src/parser/ELR/DFA/candidate.ts:36

eq

eq(other: {
digested: number;
gr: Readonly<GrammarRule<T>>;
}): boolean
Parameters
- other: {
  digested: number;
  gr: Readonly<GrammarRule<T>>;
  }
  - digested: number
  - gr: Readonly<GrammarRule<T>>
Returns boolean
- Defined in src/parser/ELR/DFA/candidate.ts:84

getNext

getNext(node: Readonly<ASTNode<any>>): null | Candidate<T>
Accept the node and generate next candidate with digested + 1.

Return null if the node can not be accepted.
Parameters
- node: Readonly<ASTNode<any>>
Returns null | Candidate<T>
- Defined in src/parser/ELR/DFA/candidate.ts:45

toString

toString(): string
Return NT <= ...before @ ...after. The result will be cached for future use.

Returns string
- Defined in src/parser/ELR/DFA/candidate.ts:65

tryLex

tryLex(lexer: ILexer, followSets: ReadonlyMap<string, GrammarSet>): {
lexer: ILexer;
node: ASTNode<T>;
}[]
Try to use lexer to yield an ASTNode with type and/or content specified by this.current. Return all the possible results.
Parameters
- lexer: ILexer
- followSets: ReadonlyMap<string, GrammarSet>
Returns {
lexer: ILexer;
node: ASTNode<T>;
}[]
- Defined in src/parser/ELR/DFA/candidate.ts:95

tryReduce

tryReduce(buffer: readonly ASTNode<T>[], entryNTs: ReadonlySet<string>, followSets: ReadonlyMap<string, GrammarSet>, lexer: ILexer, cascadeQueryPrefix: undefined | string, logger: Logger): {
    commit?: boolean;
    context?: ParserContext<T>;
    res: ParserOutput<T>;
}
Only failed if:
1. Digestion not finished.
2. Check follow set failed.
3. Rejecter rejected.
Parameters
- buffer: readonly ASTNode<T>[]
- entryNTs: ReadonlySet<string>
- followSets: ReadonlyMap<string, GrammarSet>
- lexer: ILexer
- cascadeQueryPrefix: undefined | string
- logger: Logger
Returns {
    commit?: boolean;
    context?: ParserContext<T>;
    res: ParserOutput<T>;
}
- Optional commit?: boolean
- Optional context?: ParserContext<T>
- res: ParserOutput<T>
- Defined in src/parser/ELR/DFA/candidate.ts:124

`Static` getString

getString<T>(data: Pick<Candidate<T>, "digested" | "gr">, sep?: string, arrow?: string, index?: string): string
Type Parameters
- T
Parameters
- data: Pick<Candidate<T>, "digested" | "gr">
- sep: string = " "
- arrow: string = "<="
- index: string = "@"
Returns string
- Defined in src/parser/ELR/DFA/candidate.ts:69

Generated using TypeDoc