Using stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not

Algorithm parseparens

This algorithm reads a source program and parses it to make sure all opening -

closing parenthesis are paired

1. loop (more data)

read (character)

if (character is not a  closing parenthesis)

pushstack ( stack, character)

else

if (character is closing parenthesis)

popstack (stack, token)

while ( token is not  an opening paranthesis)

popstack (stack, token)

endwhile

end if

end if

end loop

 if (not emptystack (stack))

 print (Error: opening parenthesis not matched) 

end parseparens.

 

Posted Date: 5/11/2013 1:30:26 AM | Location : United States

Ask an Expert

Thanks for suggesting me this answer, appreciate your knowledge.  Posted by | Posted Date: 5/11/2013 1:31:02 AM

Related Discussions:- Whether the infix expression has balanced parenthesis or not, Assignment Help, Ask Question on Whether the infix expression has balanced parenthesis or not, Get Answer, Expert's Help, Whether the infix expression has balanced parenthesis or not Discussions

Write discussion on Whether the infix expression has balanced parenthesis or not
Your posts are moderated

Write your message here..

Related Questions

Stack, Explain the array and linked list implementation of stack Explain the array and linked list implementation of stack

Circular queues and implement circular queues using array, Explain what are... Explain what are circular queues? Write down routines required for inserting and deleting elements from a circular queue implemented using arrays.           Circular queue:

Sorting, compare and contrast the bubble sort,quick sort,merge sort and rad... compare and contrast the bubble sort,quick sort,merge sort and radix sort

Deletion and insertion from queues, explain deletion and insertion in a que... explain deletion and insertion in a queue

Big o notation, This notation gives an upper bound for a function to within... This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))

Array, how to define the size of array how to define the size of array

State hsv colour model, HSV Colour Model Instead of a set of colour pri... HSV Colour Model Instead of a set of colour primaries, the HSV model uses colour descriptions that have a more intuitive appeal to a user. To give a colour specification, a use

Queues, what is queues? how it work? and why it used? i want an assignment... what is queues? how it work? and why it used? i want an assignment on queue .....

Compare two functions, Comp are two functions n 2    and  2 n  / 4... Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

Number of leaf nodes in a complete binary tree, The number of leaf nodes in... The number of leaf nodes in a complete binary tree of depth d is    2 d