Parenthesis checker, C++ (gcc)

Language: Layout:

//Title of this code

#include <iostream>
#include <string>
#include <list>

using namespace std;

bool matchParenthesis(char a, char b) {
 
    if (a == '(' && b == ')')
        return true;  
    if (a == '[' && b == ']')
        return true;
    if (a == '{' && b == '}')
        return true;
    if (a == '<' && b == '>')
        return true;
    
    return false;
    
}

// () {} [] <>
bool checkMultiParenthesis(const string& s) {
    
    list<char> stack;
    
    for (int i = 0; i < s.length(); ++i) {
     
        // opener
        if (s[i] == '(' || s[i] == '{' || s[i] == '[' || s[i] == '<')
            stack.push_back(s[i]);
        
        
        // closer
        if (s[i] == ')' || s[i] == '}' || s[i] == ']' || s[i] == '>') {
            
            if (stack.empty() || !matchParenthesis(stack.back(), s[i]))
                return false;
               
            stack.pop_back();
                
        }
    }
    
    return true;
}

//eg. ((alf)ls) ? valid
//    )( (dkk)() ? invalid
//
//   )( )(( ))(
//

bool checkParentheses(const string& s) {

bool foundFirst = false;
        
    int sum = 0; 
    int i = 0;
    while (i < s.length()) {

if (!foundFirst && s[i] == ')')
            return false;
        
        else if (s[i] == ')')
            --sum;
        
        else if (s[i] == '(') {
            foundFirst = true;
            ++sum;
        }

++i;
    }
    
    return !sum;
}

int main()
{
    std::cout << boolalpha << checkParentheses("a(a)a(a)a") << endl;
    std::cout << boolalpha << checkParentheses("ae()w()(a()()r()(d)()()g()(e))()aa") << endl;
    
    
    cout << boolalpha << checkMultiParenthesis(" < ( [] { {}{<>} } ) >    ") << endl;
    
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.36 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.59 sec