Description: Symbols balance
In language often needs to determine whether some of the symbols appear in pairs, such as {}, [], (). How to determine the symbol symmetrical primary task is a lot of language syntax checking.
Design a function to check the expression of the symbol (), [], {} is balanced. If the balance returns 1 returns 0 if the imbalance.
For example:
a (dda) {[dfsafd [dfsd]] (((fdsd) dfd)) dfd} is a symbol balanced.
{ad [x (df) ds)]} is not a symbol balanced.
To Search:
File list (Check if you may need any files):
ds8.c
Download