Expression parsing
Problems on expression parsing, including evaluating arithmetic and logical expressions, converting between infix, prefix and postfix notation, checking bracket balance, parsing simple programming languages and matching patterns.
The stack article in the Data structures section and the recursion article cover the two usual approaches. Related problem sets are under Stacks and Strings.
Problems
From prefix to infix#731
Medium
Robot#759
Hard
Recursion#1391
Very hard
Parenthesis#1801
Very easy
Guess the Numbers#3069
Medium
Testing Circuits#3292
Very hard
ASCII Expression#3436
Medium
Where's Wally#3466
Very easy
Mobile Network#3601
Very hard
Expressions#3837
Hard
Firefighters#5757
Medium
Show me the Step#6372
Very easy
Colors#6850
Hard
Infix to Prefix#7021
Very easy
Characteristic#10028
Medium
COWBASIC#10531
Very hard