|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use lalr_item | |
---|---|
java_cup |
Uses of lalr_item in java_cup |
---|
Methods in java_cup that return lalr_item | |
---|---|
lalr_item |
lalr_item_set.add(lalr_item itm)
Add a singleton item, merging lookahead sets if the item is already part of the set. |
lalr_item |
lalr_item_set.find(lalr_item itm)
Return the item in the set matching a particular item (or null if not found) |
lalr_item |
lalr_item_set.get_one()
Remove and return one item from the set (done in hash order). |
lalr_item |
lalr_item.shift()
Produce the new lalr_item that results from shifting the dot one position to the right. |
Methods in java_cup with parameters of type lalr_item | |
---|---|
void |
lalr_item.add_propagate(lalr_item prop_to)
Add a new item to the set of items we propagate to. |
lalr_item |
lalr_item_set.add(lalr_item itm)
Add a singleton item, merging lookahead sets if the item is already part of the set. |
boolean |
lalr_item_set.contains(lalr_item itm)
Does the set contain a particular item? |
boolean |
lalr_item.equals(lalr_item other)
Equality comparison -- here we only require the cores to be equal since we need to do sets of items based only on core equality (ignoring lookahead sets). |
lalr_item |
lalr_item_set.find(lalr_item itm)
Return the item in the set matching a particular item (or null if not found) |
void |
lalr_item_set.remove(lalr_item itm)
Remove a single item if it is in the set. |
protected void |
lalr_state.report_reduce_reduce(lalr_item itm1,
lalr_item itm2)
Produce a warning message for one reduce/reduce conflict. |
protected void |
lalr_state.report_shift_reduce(lalr_item red_itm,
int conflict_sym)
Produce a warning message for one shift/reduce conflict. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |