#include <FullLZEnumeration.h>
|
| FullLZEnumeration (Grammar_t *g) |
|
size_t | compute_possible_referents (const Node &root, const nonterminal_t nt) |
| Compute the number of things in n which could be referenced Here, we will require references to prior nodes to be unique and complete and only of type nt. More...
|
|
Node & | get_referent (const Node &root, size_t cnt, const nonterminal_t nt) |
|
virtual Node | toNode (IntegerizedStack &is, const nonterminal_t nt, Node &root) |
| Convert to a node, using root as the root – NOTE that when root is null, we use out as the root. More...
|
|
virtual Node | toNode (enumerationidx_t z, const nonterminal_t nt, Node &root) |
|
virtual Node | toNode (enumerationidx_t z, const nonterminal_t nt) |
|
virtual enumerationidx_t | toInteger (const Node &root, const Node &n) |
|
template<typename Grammar_t>
class FullLZEnumeration< Grammar_t >
- Author
- piantado
- Date
- 02/01/21
◆ FullLZEnumeration()
template<typename Grammar_t >
◆ compute_possible_referents()
template<typename Grammar_t >
Compute the number of things in n which could be referenced Here, we will require references to prior nodes to be unique and complete and only of type nt.
- Parameters
-
- Returns
◆ get_referent()
template<typename Grammar_t >
◆ toInteger()
template<typename Grammar_t >
◆ toNode() [1/3]
template<typename Grammar_t >
Convert to a node, using root as the root – NOTE that when root is null, we use out as the root.
- Parameters
-
- Returns
◆ toNode() [2/3]
template<typename Grammar_t >
◆ toNode() [3/3]
template<typename Grammar_t >
The documentation for this class was generated from the following file: