Register

infix to postfix notation under customized operator precedence

381 views
0 votes
0 votes

A designed a language with following features:

+ precedes /

/ precedes -

- precedes *

* at same level with ^

+ and * right to left asscociativity.

Then correct stack priorities for +,*,^, / for correctly converting infix to postfix form?

5,1,2,4         4,1,5,2    3,1,1,2    none

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
MohammedSunasra asked Mar 31, 2016
584 views
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
Is Infix, Pre-fix and Postfix evaluation there (in syllabus) in Stacks topic under Data Structures?
User Avatar
0 votes
0 votes
0 answers
3
Mk Utkarsh asked Oct 20, 2018
860 views
Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);
Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);
User Avatar
0 votes
0 votes
0 answers
4
Radha mohan asked Dec 26, 2017
1,051 views
Infix to postfix time complexity
Sir it is given everywhere that time complexity of infix to postfix is O(1) but according to algorithm for some operators we have to traverse back the stack until we find a operator with less precedence than this so is it always O(1 ) even if we do amortized analysis
Sir it is given everywhere that time complexity of infix to postfix is O(1) but according to algorithm for some operators we have to traverse back the stack until we find...
User Avatar
Link Copied!