Cadabra
Computer algebra system for field theory problems
|
#include <Parser.hh>
Public Member Functions | |
Parser () | |
Parser (std::shared_ptr< Ex >) | |
Parser (std::shared_ptr< Ex >, const std::string &) | |
void | erase () |
void | remove_empty_nodes () |
void | finalise () |
bool | string2tree (const std::string &inp) |
Public Attributes | |
std::shared_ptr< Ex > | tree |
Private Types | |
enum | mode_t { m_skipwhite, m_name, m_findchildren, m_singlecharname, m_backslashname, m_childgroup, m_initialgroup, m_verbatim, m_property } |
Private Member Functions | |
void | advance (unsigned int &i) |
unsigned char | get_token (unsigned int i) |
bool | is_number (const std::string &str) const |
str_node::bracket_t | is_closing_bracket (const unsigned char &br) const |
str_node::bracket_t | is_opening_bracket (const unsigned char &br) const |
str_node::parent_rel_t | is_link (const unsigned char &ln) const |
Private Attributes | |
Ex::iterator | parts |
std::string | str |
std::vector< mode_t > | current_mode |
std::vector< str_node::bracket_t > | current_bracket |
std::vector < str_node::parent_rel_t > | current_parent_rel |
|
private |
Parser::Parser | ( | ) |
Parser::Parser | ( | std::shared_ptr< Ex > | t | ) |
Parser::Parser | ( | std::shared_ptr< Ex > | t, |
const std::string & | str | ||
) |
|
private |
void Parser::erase | ( | ) |
void Parser::finalise | ( | ) |
|
private |
|
private |
|
private |
|
private |
|
private |
void Parser::remove_empty_nodes | ( | ) |
bool Parser::string2tree | ( | const std::string & | inp | ) |
|
private |
|
private |
|
private |
|
private |
|
private |
std::shared_ptr<Ex> cadabra::Parser::tree |