Using stacks write an algorithm to determine whether the, Ask an Expert

Engineering

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 loop

if (not emptystack (stack))

print (Error: opening parenthesis not matched)

end parseparens.

View complete question

Computer Engineering, Engineering

Category:- Computer Engineering
Reference No.:- M9545416

Have any Question?Write your Review or question?

Related Questions in Computer Engineering

Question research and discuss strategies and techniques

Question : Research and discuss strategies and techniques for improving a web site's presence and ranking in popular search engines such as Google and Yahoo. What are some of the new form attributes in HTML5? How are the ...

Are there more children diagnosed with autism spectrum

Are there more children diagnosed with Autism Spectrum Disorder (ASD) in states that have larger urban areas over states that are mostly rural? In the state of Pennsylvania, a fairly urban state, there are 245 eight year ...

In thenbspworkspaceproject-lognbspdirectory create file

In the ~/workspace/project-log directory, create file named changelog.txt with the following content and format: Changelog Version: 1.0 Redirect the output of the ls command to a file named file-list.txt in the ~/wor ...

Is there any difference in terms of the information that

Is there any difference in terms of the information that could be provided to the decision maker by an IS that was created using HSM and an IS that was created using SSM?

Shellys preferences for consumption and leisure can be

Shelly's preferences for consumption and leisure can be expressed as U(C, L) = (C - 100) (L - 40). This utility function implies that Shelly's marginal utility of leisure is C - 100 and her marginal utility of consumptio ...

Find minimal dfas for the following languages in each case

Find minimal dfa's for the following languages. In each case prove that the result is minimal. (1) L = {a n bm> :n≥2,m≥1}. (2)L = {a n :n ≥ 0,n ≠ 3} (3) L = {a n :n mod 3 = 0}∪{a n : n mod 5 = 1}

Can someone help solve this problem in lisp-programming

Can someone help solve this problem in Lisp-Programming language? More specifically in DrRacket. Exercise: A professor keeps the quiz grades of a student in a non-empty vector of non-negative numbers. Write a function th ...

A stock is expected to pay a 400 dividend per share the

A stock is expected to pay a $4.00 dividend per share. The growth rate is expected to be 5%. If investors demand 10% on this stock, what is the expected price of the stock 10 years from now?

What is unified threat management utm and the services it

What is Unified Threat Management (UTM) and the services it combines into one device. Does UTM holds true to the principle of defense-in-depth

Given a list of numbers l a value x is said to be a

Given a list of numbers L, a value x is said to be a majority value if the value of over half the elements in L is x; in other words, if L has n elements and nx is the number of elements in L with value x, then x is a ma ...

4,153,160 Questions Asked
13,132 Experts
2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Recent Questions

Ask Computer Engineering Expert