Struct Ll1Table 

pub struct Ll1Table {
    pub table: HashMap<(usize, Option<usize>), usize>,
    pub n_nonterms: usize,
    pub n_terms: usize,
}

An LL(1) parsing table for a given grammar.

Fields

table: HashMap<(usize, Option<usize>), usize>

For each (nonterminal, terminal) pair, the production index to use. The terminal None represents end-of-input.

n_nonterms: usize

Number of nonterminals.

n_terms: usize

Number of terminals.

Implementations

impl Ll1Table

pub fn new(n_nonterms: usize, n_terms: usize) -> Self

Create an empty LL(1) table.

pub fn set(&mut self, nt: usize, term: Option<usize>, prod: usize)

Set the production for (nonterminal, terminal).

pub fn get(&self, nt: usize, term: Option<usize>) -> Option<usize>

Look up the production for (nonterminal, terminal).

pub fn is_conflict_free(&self) -> bool

Check if the table is conflict-free (no cell has more than one production). Since we use a HashMap, each cell has at most one entry by construction.

pub fn entry_count(&self) -> usize

Count the number of filled table entries.

pub fn build(grammar: &ContextFreeGrammar, sets: &FirstFollowSets<'_>) -> Self

Build an LL(1) table from a grammar and its FIRST/FOLLOW sets.