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

fix unbounded regexp parser

parent f1880f60
No related branches found
No related tags found
No related merge requests found
...@@ -363,7 +363,7 @@ ConversionHandler::TFormalism ConversionHandler::parseFormalismFromTokens( void ...@@ -363,7 +363,7 @@ ConversionHandler::TFormalism ConversionHandler::parseFormalismFromTokens( void
{ {
std::string xmlMark = m_tokens.front( ).getData( ); std::string xmlMark = m_tokens.front( ).getData( );
   
if( xmlMark == "automaton" || xmlMark == "nfa" ) if( xmlMark == "automaton" || xmlMark == "NFA" )
return FINITE_AUTOMATON; return FINITE_AUTOMATON;
   
if( xmlMark == "regexp" || xmlMark == "unboundedRegexp" ) if( xmlMark == "regexp" || xmlMark == "unboundedRegexp" )
......
...@@ -131,6 +131,7 @@ int main(int argc, char* argv[]) ...@@ -131,6 +131,7 @@ int main(int argc, char* argv[])
} }
catch( const exception::AlibException & exception ) { catch( const exception::AlibException & exception ) {
alib::DataFactory::toStdout(exception); alib::DataFactory::toStdout(exception);
std::cout << exception << std::endl;
return 1; return 1;
} catch (...) { } catch (...) {
return 127; return 127;
......
...@@ -99,17 +99,8 @@ UnboundedRegExpElement* RegExpFromXMLParser::parseUnboundedRegExpElement(std::li ...@@ -99,17 +99,8 @@ UnboundedRegExpElement* RegExpFromXMLParser::parseUnboundedRegExpElement(std::li
UnboundedRegExpAlternation* RegExpFromXMLParser::parseUnboundedRegExpAlternation(std::list<sax::Token>& input) const { UnboundedRegExpAlternation* RegExpFromXMLParser::parseUnboundedRegExpAlternation(std::list<sax::Token>& input) const {
popToken(input, sax::Token::TokenType::START_ELEMENT, "alternation"); popToken(input, sax::Token::TokenType::START_ELEMENT, "alternation");
   
UnboundedRegExpElement* element1 = parseUnboundedRegExpElement(input);
UnboundedRegExpElement* element2 = parseUnboundedRegExpElement(input);
UnboundedRegExpAlternation* alternation = new UnboundedRegExpAlternation(); UnboundedRegExpAlternation* alternation = new UnboundedRegExpAlternation();
   
alternation->appendElement(std::move(*element1));
alternation->appendElement(std::move(*element2));
delete element1;
delete element2;
while (isTokenType(input, sax::Token::TokenType::START_ELEMENT)) { while (isTokenType(input, sax::Token::TokenType::START_ELEMENT)) {
UnboundedRegExpElement* element = parseUnboundedRegExpElement(input); UnboundedRegExpElement* element = parseUnboundedRegExpElement(input);
alternation->appendElement(std::move(*element)); alternation->appendElement(std::move(*element));
...@@ -123,17 +114,8 @@ UnboundedRegExpAlternation* RegExpFromXMLParser::parseUnboundedRegExpAlternation ...@@ -123,17 +114,8 @@ UnboundedRegExpAlternation* RegExpFromXMLParser::parseUnboundedRegExpAlternation
UnboundedRegExpConcatenation* RegExpFromXMLParser::parseUnboundedRegExpConcatenation(std::list<sax::Token>& input) const { UnboundedRegExpConcatenation* RegExpFromXMLParser::parseUnboundedRegExpConcatenation(std::list<sax::Token>& input) const {
popToken(input, sax::Token::TokenType::START_ELEMENT, "concatenation"); popToken(input, sax::Token::TokenType::START_ELEMENT, "concatenation");
   
UnboundedRegExpElement* element1 = parseUnboundedRegExpElement(input);
UnboundedRegExpElement* element2 = parseUnboundedRegExpElement(input);
UnboundedRegExpConcatenation* concatenation = new UnboundedRegExpConcatenation(); UnboundedRegExpConcatenation* concatenation = new UnboundedRegExpConcatenation();
   
concatenation->appendElement(std::move(*element1));
concatenation->appendElement(std::move(*element2));
delete element1;
delete element2;
while (isTokenType(input, sax::Token::TokenType::START_ELEMENT)) { while (isTokenType(input, sax::Token::TokenType::START_ELEMENT)) {
UnboundedRegExpElement* element = parseUnboundedRegExpElement(input); UnboundedRegExpElement* element = parseUnboundedRegExpElement(input);
concatenation->appendElement(std::move(*element)); concatenation->appendElement(std::move(*element));
......
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