![]() |
Fleet
0.0.9
Inference in the LOT
|
Classes | |
class | SExpNode |
Functions | |
void | assert_check_parens (const std::string &s) |
std::string | trim (std::string x) |
std::vector< std::string > | tokenize (std::string s) |
std::string | pop_front (std::vector< std::string > &q) |
SExpNode | __parse (std::vector< std::string > &tok) |
Recursive parsing of S-expressions. Not high qualtiy. Basically, if we get ((A...) B...) then we call T's constructor with no arguments and make (A...) the first child. If we get (A ....) then we call with "A" as the first argument to the constructor because in some cases (like Binding) we want to handle this as a "label" on the node; in others like CL we want it to be an Node itself. More... | |
SExpNode | parse (std::vector< std::string > &tok) |
Wrapper to parse to remove outer (...) More... | |
SExpNode | parse (std::string s) |
SExpNode SExpression::__parse | ( | std::vector< std::string > & | tok | ) |
Recursive parsing of S-expressions. Not high qualtiy. Basically, if we get ((A...) B...) then we call T's constructor with no arguments and make (A...) the first child. If we get (A ....) then we call with "A" as the first argument to the constructor because in some cases (like Binding) we want to handle this as a "label" on the node; in others like CL we want it to be an Node itself.
tok |
void SExpression::assert_check_parens | ( | const std::string & | s | ) |
SExpNode SExpression::parse | ( | std::vector< std::string > & | tok | ) |
Wrapper to parse to remove outer (...)
tok |
SExpNode SExpression::parse | ( | std::string | s | ) |
std::string SExpression::pop_front | ( | std::vector< std::string > & | q | ) |
std::vector<std::string> SExpression::tokenize | ( | std::string | s | ) |
std::string SExpression::trim | ( | std::string | x | ) |