/** Convert to string. */ public String toString() { StringBuffer result = new StringBuffer(); result.append("{\n"); for (Enumeration e=all(); e.hasMoreElements(); ) { result.append(" " + (lalr_item)e.nextElement() + "\n"); } result.append("}"); return result.toString(); } /*-----------------------------------------------------------*/
/** Convert to string. */ public String toString() { StringBuffer result = new StringBuffer(); result.append("{\n"); for (Enumeration e=all(); e.hasMoreElements(); ) { result.append(" " + (lalr_item)e.nextElement() + "\n"); } result.append("}"); return result.toString(); } /*-----------------------------------------------------------*/
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Add a complete set, merging lookaheads where items are already in * the set * @param other the set to be added. */ public void add(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the adds individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) add((lalr_item)e.nextElement()); }
/** Is this set an (improper) subset of another? * @param other the other set in question. */ public boolean is_subset_of(lalr_item_set other) throws internal_error { not_null(other); /* walk down our set and make sure every element is in the other */ for (Enumeration e = all(); e.hasMoreElements(); ) if (!other.contains((lalr_item)e.nextElement())) return false; /* they were all there */ return true; }
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Add a complete set, merging lookaheads where items are already in * the set * @param other the set to be added. */ public void add(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the adds individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) add((lalr_item)e.nextElement()); }
/** Add a complete set, merging lookaheads where items are already in * the set * @param other the set to be added. */ public void add(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the adds individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) add((lalr_item)e.nextElement()); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Add a complete set, merging lookaheads where items are already in * the set * @param other the set to be added. */ public void add(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the adds individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) add((lalr_item)e.nextElement()); }
/** Propagate lookahead sets out of this state. This recursively * propagates to all items that have propagation links from some item * in this state. */ protected void propagate_lookaheads() throws internal_error { /* recursively propagate out from each item in the state */ for (Enumeration itm = items().all(); itm.hasMoreElements(); ) ((lalr_item)itm.nextElement()).propagate_lookaheads(null); }
/** Remove (set subtract) a complete set. * @param other the set to remove. */ public void remove(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the removes individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) remove((lalr_item)e.nextElement()); }
/** Add a complete set, merging lookaheads where items are already in * the set * @param other the set to be added. */ public void add(lalr_item_set other) throws internal_error { not_null(other); /* walk down the other set and do the adds individually */ for (Enumeration e = other.all(); e.hasMoreElements(); ) add((lalr_item)e.nextElement()); }