# I'm almost done but there are few problems

I have a stack which inputs an infix algorithm, then when I hit ENTER it converts to postfix then checks if it is legal then if it is legal, then the arithmetic operation solves, else the error dialog message box will occur. But it only happens in one digit positive value. I want it also together with negative value, decimal value, exponential value and more than one digit value... Please help me

Posted by on

• Level 3:

An expert who has achieved level 3 by getting 1000 points

All-Star:

An expert that got 10 achievements.

MVP:

An expert that got 5 achievements.

An expert that has over 10,000 points.

• Master

It has been almost 17 months, and nobody has helped you.
By now, you probably have failed the computer-course,
and no longer need any help.

Posted on Dec 03, 2009

Hi,
a 6ya expert can help you resolve that issue over the phone in a minute or two.
best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.
the service is completely free and covers almost anything you can think of (from cars to computers, handyman, and even drones).
goodluck!

Posted on Jan 02, 2017

×

my-video-file.mp4

×

## Related Questions:

### How do i add fractions on this calculator?

Press SHIFT [SETUP] 1 to switch to the MthIO mode if you haven't already done so. Use the stacked-boxes key just below the CALC key to enter fractions. For example, to enter 2/3, press stacked-boxes 2 cursor-right 3. For mixed fractions use SHIFT stacked-boxes. For example, to enter 1 1/2 press SHIFT stacked-boxes 1 cursor-right 1 cursor-right 2 cursor-right.

As a full example, to add 1/2 and 1/3, press stacked-boxes 1 cursor-right 2 cursor-right + stacked-boxes 1 cursor-right 3 cursor-right =

(The final cursor-right just before = is optional.)

Jun 04, 2014 | Casio FX-115ES Scientific Calculator

### How do i add fractions?

Press SHIFT [SETUP] 1 to switch to the MthIO mode if you haven't already done so. Use the stacked-boxes key just below the CALC key to enter fractions. For example, to enter 2/3, press stacked-boxes 2 cursor-right 3. For mixed fractions use SHIFT stacked-boxes. For example, to enter 1 1/2 press SHIFT stacked-boxes 1 cursor-right 1 cursor-right 2 cursor-right.

As a full example, to add 1/2 and 1/3, press stacked-boxes 1 cursor-right 2 cursor-right + stacked-boxes 1 cursor-right 3 cursor-right =

(The final cursor-right just before = is optional.)

Jun 04, 2014 | Casio FX-115ES Scientific Calculator

### Stacking problem

That's exactly what's supposed to happen. When you hit "1" it starts to input the number 1 into X. When you press "ENTER" it finishes the number entry and lifts the stack, copying the 1 in X into Y.
If you press a digit key now it will overwrite the number in X.
If you press "+" now, it will add X and Y, giving 2.
If you press a function it will execute that function on the number in X. For example, pressing LN will give you 0. In this case, you don't need to hit "ENTER" at all. To calculate the natural log of 2, for example, you can simply press 2 LN.

Mar 10, 2012 | HP 33s Calculator

### The calculator we made in visual basic can't function all four operations consecutively

You really have to give a lot more information in order to enable me to help you. However, by wild guessing, I am trying to nudge you into the right direction.

I assume you are trying to program a simple + - * / = infix calculator with or without a graphical user interface.

To get operators and operator precedence right, it is a good idea to create to a data structure of type stack. Stacks are abstract containers with operations push(), pop() and isempty().
• Push() puts a new object to the stack,
• Pop() removes one object from the stack and returns it, unless the stack is empty, in which case an error is generated,
• isempty() is a boolean function that checks if the stack is empty.
A nice-to-have convenience extra is an operation top(). It returns the topmost stack element without removing it (you can emulate by a pop(); push() sequence at some performance costs, so its not a strict requirement for a stack).
only
Stacks are LIFO memories, Last In, First Out, so what you push most recently will get returned by pop first. Just like a stack of cards where you can put a new card only to the top and take away from the top, too.

Processing of the input is done according to the "Shunting-Yard Algorithm", invented by Edsger Wybe Dijkstra. The link directs you to the Wikipedia page of the algorithm, which does an extensive discussion, much nicer than what I could do here on FixYa.

Jan 08, 2011 | Office Equipment & Supplies

### How to convert infix to postfix using stacks in java programming?

u can try the follwing coding
import java.io.*;
import java.util.*;
//begin coding for the stack interface
interface Stack<E>
{
public boolean isEmpty();//tests is current stack is empty. Returns true if so, and false if not.
public E top() throws StackException;//retrieves value at the top of the stack. Stack cannot be empty.
public void push(E value) throws StackException;//pushes a value on the top of the stack.
public void pop() throws StackException;//removes a value from the top of the stack. Stack cannot be empty.
}//terminates coding of Stack interface

//begin coding for the objArrayStack class
class objArrayStack<E> implements Stack<E>
{
//constructor
public objArrayStack()
{
topValue=-1;
}//terminates constructor
public void push(E value)throws StackException
{
if(topValue<ArraySize-1)//currrent stack is not full
{
++topValue;
Info[topValue]=value;
}//terminates if
else //current stack is full
throw new StackException("Error: Overflow");
}//terminates push method
public void pop() throws StackException
{
if(!isEmpty())//current stack is not empty
--topValue;
else //stack is empty
throw new StackException("Error: Underflow");
}//terminates pop method
public boolean isEmpty()
{
}//terminates isEmpty method
public E top() throws StackException
{
if(!isEmpty())//stack is not empty
return (E)Info[topValue];
else //stack is empty
throw new StackException("Error: Underflow");
}//terminates top method
//declare instance variables
final int ArraySize=10;
private Object Info[]=new Object[ArraySize];
private int topValue;

//begins coding for the StackException class
class StackException extends RuntimeException
{
//constructor
public StackException(String str)
{
super(str);
}//terminates text of constructor
}//terminates text of StackException class

//method to convert from infix to postfix notation
public static String InToPost(String infixString)
{
//operator stack initialized
objArrayStack<Character> operatorStack = new objArrayStack<Character>();
//postfix string initialized as empty
String postfixString = " ";
//scan infix string and take appropriate action
for(int index = 0; index < infixString.length(); ++index)
{
char chValue = infixString.charAt(index);
if(chValue == '(')
operatorStack.push('(');
else if(chValue == ')')
{
Character oper = operatorStack.top();
while(!(oper.equals('(')) && !(operatorStack.isEmpty()))
{
postfixString += oper.charValue();
operatorStack.pop();
oper = operatorStack.top();
}//end while loop
operatorStack.pop();
}//end else if
else if(chValue == '+' || chValue == '-')
{
if(operatorStack.isEmpty()) //operatorStack is empty
operatorStack.push(chValue);
else //current operatorStack is not empty
{
Character oper = operatorStack.top();
while(!(operatorStack.isEmpty() || oper.equals(new Character('(')) || oper.equals(new Character(')'))))
{
operatorStack.pop();
postfixString += oper.charValue();
}//ends while loop
operatorStack.push(chValue);
}//end else
}//end else if
else if(chValue == '*' || chValue == '/')
{
if(operatorStack.isEmpty())
operatorStack.push(chValue);
else
{
Character oper = operatorStack.top();
while(!oper.equals(new Character('+')) && !oper.equals(new Character('-')) && !operatorStack.isEmpty())
{
operatorStack.pop();
postfixString += oper.charValue();
}//end while loop
operatorStack.push(chValue);
}//end else
}//end else if
else
postfixString += chValue;
}//end for loop
while(!operatorStack.isEmpty())
{
Character oper = operatorStack.top();
if(!oper.equals(new Character('(')))
{
operatorStack.pop();
postfixString += oper.charValue();
}//end if
}//end while
return postfixString ;
}//terminates text of InToPost method

public static void main(String[]args)
{
objArrayStack mystack = new objArrayStack();
System.out.println("Enter a string");
Scanner scan = new Scanner(System.in);
scan.nextLine();
String str = scan.nextLine();
InToPost(str);
}//terminates text of main method
}//terminates text of objArrayStack class

Mar 16, 2010 | Sun Java Programming Language (cdj-275)

### How do I edit text on a pdf file?

With Acrobat 6 Professional -Select Tools > Advanced Editing > TouchUp Text Tool
Next, click on the text line where you want to do an edit.
Click-drag to select a string of characters and let your fingers walk the keyboard.
Or, just start where you've placed the cursor.
You'll find it somewhat awkward. PDF is not a word editing/processing
format. If desired edits are few and simple the TouchUp Text Tool
will suffice. If the desired edits are more than you really want to return
to the authoring application (word processor, whatever) to make the edits.
Then produce a new output PDF.

Note that the above presumes the PDF does not have security applied that prevents such edits.

Mar 01, 2009 | Adobe Acrobat 6.0 Professional for PC

### My E-Mail Server is down

the solution i will be posting assumes you already have postfix installed in the new machine and that your new postfix server is able to relay mails. Old configurations has been copied/transported to the new server ( and the only remaining task is to move all the mails to the new postfix server.

also make sure you have copied

/etc/passwd
/etc/group
/var/spool/mail

to your new mail server ( these are your mail related files)

Note: This is assuming you have identical setup you have with your old email server. double check your postfix configuaration before proceeding.

Good Luck

Oct 22, 2008 | Dell Dimension 3000 PC Desktop

### Tree structure

Jan 29, 2008 | Computers & Internet

## Open Questions:

#### Related Topics:

26 people viewed this question

Level 3 Expert

Level 3 Expert