A shunting algorithm written in swiprolog
3128
£250(approx. $330)
 Posted:
 Proposals: 0
 Remote
 #19698
 Archived
Description
Experience Level: Expert
Here is the school project I have been set. I need a program written in swi prolog which works with the problem below. However there are certain rules and regulations which should be met. This will be given when bidders request this.
Write a Prolog program for the following problem
Implement in Prolog the shunting algorithm as described in the lecture for converting an expression in
infix notation into postfix notation. For examples, the goals
shunt([(,2,+,3,’)’,*,4],X) will return X=[2,3,+,4,*]
shunt([35,,5,*,4,+,2],X) will return X=[35,5,4,*,,2,+].
shunt([(,a,+,b,’)’,*,c],X) will return X=[a,b,+,b,*]
More test cases should be used to demonstrate the working of the program.
Write a Prolog program for the following problem
Implement in Prolog the shunting algorithm as described in the lecture for converting an expression in
infix notation into postfix notation. For examples, the goals
shunt([(,2,+,3,’)’,*,4],X) will return X=[2,3,+,4,*]
shunt([35,,5,*,4,+,2],X) will return X=[35,5,4,*,,2,+].
shunt([(,a,+,b,’)’,*,c],X) will return X=[a,b,+,b,*]
More test cases should be used to demonstrate the working of the program.
Essex B.
0% (0)Projects Completed

Freelancers worked with

Projects awarded
0%
Last project
15 Oct 2018
United Kingdom
New Proposal
Create an account now and send a proposal now to get this project.
Sign upClarification Board Ask a Question

There are no clarification messages.