| __generate(const nonterminal_t ntfrom=nt< output_t >(), unsigned long depth=0) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| add(std::string fmt, Primitive< T, args... > &b, double p=1.0, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| add(std::string fmt, std::function< T(args...)> f, double p=1.0, Op o=Op::Standard, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| add(std::string fmt, T(*_f)(args...), double p=1.0, Op o=Op::Standard, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| add_ft(std::string fmt, T(*_f)(args...), double p=1.0, Op o=Op::Standard, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| add_terminal(std::string fmt, T x, double p=1.0, Op o=Op::Standard, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| add_vms(std::string fmt, FT *f, double p=1.0, Op o=Op::Standard, int a=0) | Grammar< cl_void, CL, CL, cl_void > | inline |
| begin() const | Grammar< cl_void, CL, CL, cl_void > | inline |
| change_probability(const std::string &s, const double newp) | Grammar< cl_void, CL, CL, cl_void > | inline |
| complete(Node &node) | Grammar< cl_void, CL, CL, cl_void > | inline |
| copy_resample(const Node &node, bool f(const Node &n)) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| count_nonterminals() const | Grammar< cl_void, CL, CL, cl_void > | inline |
| count_nonterminals(nonterminal_t nt) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| count_rules(const nonterminal_t nt) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| count_rules() const | Grammar< cl_void, CL, CL, cl_void > | inline |
| count_terminals(nonterminal_t nt) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| end() const | Grammar< cl_void, CL, CL, cl_void > | inline |
| expand_to_neighbor(Node &node, int &which) | Grammar< cl_void, CL, CL, cl_void > | inline |
| find_open_commas_close(const std::string s) | Grammar< cl_void, CL, CL, cl_void > | inline |
| from_parseable(std::deque< std::string > &q) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| from_parseable(std::string s) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| from_parseable(const char *c) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| FT typedef | Grammar< cl_void, CL, CL, cl_void > | |
| generate(const nonterminal_t ntfrom=nt< output_t >(), unsigned long depth=0) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| GENERATE_DEPTH_EXCEPTION_RETRIES | Grammar< cl_void, CL, CL, cl_void > | static |
| get_counts(const Node &node) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| get_counts(const Node &node, const std::map< const Rule *, size_t > &indexer) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| get_counts(const std::map< K, V > &m, const std::map< const Rule *, size_t > &indexer) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| get_index_of(const Rule *r) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| get_rule(const nonterminal_t nt, size_t k) const | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| get_rule(const nonterminal_t nt, const Op o, const int a=0) | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| get_rule(const nonterminal_t nt, size_t i) | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| get_rule(const nonterminal_t nt, const std::string s) const | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| get_rule(const std::string s) const | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| get_rule_indexer() const | Grammar< cl_void, CL, CL, cl_void > | inline |
| Grammar() | Grammar< cl_void, CL, CL, cl_void > | inline |
| Grammar(const Grammar &g)=delete | Grammar< cl_void, CL, CL, cl_void > | |
| Grammar(const Grammar &&g)=delete | Grammar< cl_void, CL, CL, cl_void > | |
| GRAMMAR_MAX_DEPTH | Grammar< cl_void, CL, CL, cl_void > | |
| input_t typedef | Grammar< cl_void, CL, CL, cl_void > | |
| is_in_GRAMMAR_TYPES() | Grammar< cl_void, CL, CL, cl_void > | inlinestatic |
| log_probability(const Node &n) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| makeNode(const Rule *r) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| N_NTs | Grammar< cl_void, CL, CL, cl_void > | static |
| neighbor_prior(const Node &node, int &which) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| neighbors(const Node &node) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| nt() | Grammar< cl_void, CL, CL, cl_void > | inlinestatic |
| output_t typedef | Grammar< cl_void, CL, CL, cl_void > | |
| remove_all(nonterminal_t nt) | Grammar< cl_void, CL, CL, cl_void > | inline |
| rule_normalizer(const nonterminal_t nt) const | Grammar< cl_void, CL, CL, cl_void > | inline |
| rules | Grammar< cl_void, CL, CL, cl_void > | |
| sample_rule(const nonterminal_t nt) const | Grammar< cl_void, CL, CL, cl_void > | inlinevirtual |
| simple_parse(std::string s) | Grammar< cl_void, CL, CL, cl_void > | inline |
| SKGrammar() | Combinators::SKGrammar | inline |
| start() | Grammar< cl_void, CL, CL, cl_void > | inline |
| this_t typedef | Grammar< cl_void, CL, CL, cl_void > | |
| TypeTuple typedef | Grammar< cl_void, CL, CL, cl_void > | |
| VirtualMachineState_t typedef | Grammar< cl_void, CL, CL, cl_void > | |
| Z | Grammar< cl_void, CL, CL, cl_void > | |
1.8.13