| | |
- __builtin__.dict(__builtin__.object)
-
- RuleSet
- __builtin__.object
-
- parser
class RuleSet(__builtin__.dict) |
| | |
- Method resolution order:
- RuleSet
- __builtin__.dict
- __builtin__.object
Methods defined here:
- __init__(self, rules)
- add(self, rulename, elems, commit)
- add_epsilon_free(self, eps, epsilons)
- fill(self, rules)
- init(self, rules)
- remove_epsilon(self, eps, epsilons)
Data descriptors defined here:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Methods inherited from __builtin__.dict:
- __cmp__(...)
- x.__cmp__(y) <==> cmp(x,y)
- __contains__(...)
- D.__contains__(k) -> True if D has a key k, else False
- __delitem__(...)
- x.__delitem__(y) <==> del x[y]
- __eq__(...)
- x.__eq__(y) <==> x==y
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __iter__(...)
- x.__iter__() <==> iter(x)
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __ne__(...)
- x.__ne__(y) <==> x!=y
- __repr__(...)
- x.__repr__() <==> repr(x)
- __setitem__(...)
- x.__setitem__(i, y) <==> x[i]=y
- __sizeof__(...)
- D.__sizeof__() -> size of D in memory, in bytes
- clear(...)
- D.clear() -> None. Remove all items from D.
- copy(...)
- D.copy() -> a shallow copy of D
- get(...)
- D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.
- has_key(...)
- D.has_key(k) -> True if D has a key k, else False
- items(...)
- D.items() -> list of D's (key, value) pairs, as 2-tuples
- iteritems(...)
- D.iteritems() -> an iterator over the (key, value) items of D
- iterkeys(...)
- D.iterkeys() -> an iterator over the keys of D
- itervalues(...)
- D.itervalues() -> an iterator over the values of D
- keys(...)
- D.keys() -> list of D's keys
- pop(...)
- D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised
- popitem(...)
- D.popitem() -> (k, v), remove and return some (key, value) pair as a
2-tuple; but raise KeyError if D is empty.
- setdefault(...)
- D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D
- update(...)
- D.update(E, **F) -> None. Update D from dict/iterable E and F.
If E has a .keys() method, does: for k in E: D[k] = E[k]
If E lacks .keys() method, does: for (k, v) in E: D[k] = v
In either case, this is followed by: for k in F: D[k] = F[k]
- values(...)
- D.values() -> list of D's values
- viewitems(...)
- D.viewitems() -> a set-like object providing a view on D's items
- viewkeys(...)
- D.viewkeys() -> a set-like object providing a view on D's keys
- viewvalues(...)
- D.viewvalues() -> an object providing a view on D's values
Data and other attributes inherited from __builtin__.dict:
- __hash__ = None
- __new__ = <built-in method __new__ of type object>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
- fromkeys = <built-in method fromkeys of type object>
- dict.fromkeys(S[,v]) -> New dict with keys from S and values equal to v.
v defaults to None.
|
class parser(__builtin__.object) |
| | |
Methods defined here:
- __init__(self, start_sym, grammar, scanner_kw=[])
- __str__(self)
- action_to_str(self)
- Stringify the ACTION/GOTO table for pretty-print.
- closure(self, s)
- Compute the closure of an item set.
- compute_ACTION(self)
- Compute the ACTION/GOTO table.
- compute_GOTO(self)
- Compute the GOTO table.
- compute_lr0(self)
- Compute the LR(0) sets.
- conflicts(self)
- Returns the list of conflicts in the ACTION table.
- count_conflicts(self)
- Returns the count of conflicts in the ACTION table.
- dump_sets(self)
- Pretty-print all LR(0) item sets.
- following_tokens(self, item)
- Returns all tokens following the current item.
- index(self, s)
- Returns the index of (the closure of) item set s in the LR(0) sets
list.
- init_row(self, init=None)
- Initialize a row of the ACTION table.
- itemset(self, i)
- itemsetstr(self, item, label='')
- Stringify an item set for pretty-print.
- itemstr(self, item)
- Stringify an item for pretty-print.
- kernel(self, s)
- Compute the kernel of an item set.
- next_items(self, item, visited=None)
- Compute the yet unvisited items following the given item.
Data descriptors defined here:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
- unused_rules
| |