Skip to content
Snippets Groups Projects
Commit 509dc039 authored by Jan Trávníček's avatar Jan Trávníček
Browse files

fix parsing trees

parent a21467e3
No related branches found
No related tags found
No related merge requests found
......@@ -1146,7 +1146,7 @@ tree::PrefixRankedBarTree xmlApi<tree::PrefixRankedBarTree>::parse(std::deque<sa
}
 
bool xmlApi<tree::PrefixRankedBarTree>::first(const std::deque<sax::Token>& input) {
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_TREE);
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_BAR_TREE);
}
 
void xmlApi<tree::PrefixRankedBarTree>::compose(std::deque<sax::Token>& output, const tree::PrefixRankedBarTree& data) {
......@@ -1158,7 +1158,7 @@ tree::PrefixRankedPattern xmlApi<tree::PrefixRankedPattern>::parse(std::deque<sa
}
 
bool xmlApi<tree::PrefixRankedPattern>::first(const std::deque<sax::Token>& input) {
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_TREE);
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_PATTERN);
}
 
void xmlApi<tree::PrefixRankedPattern>::compose(std::deque<sax::Token>& output, const tree::PrefixRankedPattern& data) {
......@@ -1170,7 +1170,7 @@ tree::PrefixRankedBarPattern xmlApi<tree::PrefixRankedBarPattern>::parse(std::de
}
 
bool xmlApi<tree::PrefixRankedBarPattern>::first(const std::deque<sax::Token>& input) {
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_TREE);
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_PREFIX_RANKED_BAR_PATTERN);
}
 
void xmlApi<tree::PrefixRankedBarPattern>::compose(std::deque<sax::Token>& output, const tree::PrefixRankedBarPattern& data) {
......@@ -1194,7 +1194,7 @@ tree::RankedPattern xmlApi<tree::RankedPattern>::parse(std::deque<sax::Token>& i
}
 
bool xmlApi<tree::RankedPattern>::first(const std::deque<sax::Token>& input) {
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_RANKED_TREE);
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_RANKED_PATTERN);
}
 
void xmlApi<tree::RankedPattern>::compose(std::deque<sax::Token>& output, const tree::RankedPattern& data) {
......@@ -1218,7 +1218,7 @@ tree::UnrankedPattern xmlApi<tree::UnrankedPattern>::parse(std::deque<sax::Token
}
 
bool xmlApi<tree::UnrankedPattern>::first(const std::deque<sax::Token>& input) {
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_UNRANKED_TREE);
return sax::FromXMLParserHelper::isToken(input, sax::Token::TokenType::START_ELEMENT, Names::TREE_UNRANKED_PATTERN);
}
 
void xmlApi<tree::UnrankedPattern>::compose(std::deque<sax::Token>& output, const tree::UnrankedPattern& data) {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment