Re: How to convert Infix notation to postfix notation
- From: spinoza1111 <spinoza1111@xxxxxxxxx>
- Date: Sat, 31 Oct 2009 22:17:28 -0700 (PDT)
On Nov 1, 2:22 am, Richard Heathfield <r...@xxxxxxxxxxxxxxx> wrote:
In
<ae71bbc0-4a9e-46dd-90ab-ae75a194a...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
spinoza1111wrote:
On Nov 1, 12:06 am, Richard Heathfield <r...@xxxxxxxxxxxxxxx> wrote:
In
<8fb20e6c-b3cf-4af1-87e1-7c5597145...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
spinoza1111wrote:
<150 lines of quoted but unaddressed text snipped>
Here is a C Sharp implementation of recursive descent to
translate infix to Polish notation.
The microsoft.public.dotnet.languages.csharp newsgroup exists for
C# discussions; posting your code there will give you the best
chance of getting informed reviews of that code.
I published it here to show the OP that the grammar based approach
works,
If the OP is wise, he will treat any of your code, in whatever
language, with a great deal of suspicion.
and give him "pseudo code" for his C assignment, without
doing his homework for him.
Since by now he's probably handed in his assignment, I challenge you
to translate the C Sharp code to C.
I see no value in reinventing that particular wheel. I already have
working recursive descent code. What would be the point in
Did you write it or did you steal it?
translating yours? If it works (which I doubt), I gain nothing. If it
I need to see you actually write new C code. You have a big mouth when
it comes to putting down people but the only time when you put your
big mouth on the line (the Spark Notes test) you failed. I am giving
you another chance.
I wrote and debugged a recursive descent parser for my book. I wrote
it again here after correcting the grammar because I think it's
incumbent on each one of us to be able to orally present an algorithm,
and writing it anew and posting it for comments simulates this oral
presentation.
It also demonstrates that the material is sufficiently complex for
smart people to make stupid mistakes (Knuth has himself said he
consistently gets binary search wrong the first time), and that the
stupid people aren't the ones making the mistakes.
It's the people too ready to trash and if possible render unemployable
their fellow human beings (by creating a record here) while explaining
away their own mistakes as you explained away your failure to get a
decent grade on the Spark Notes test.
You are as such contemptible.
doesn't work, I gain less still.
<snip>
--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
"Usenet is a strange place" - dmr 29 July 1999
Sig line vacant - apply within
.
- Follow-Ups:
- Re: How to convert Infix notation to postfix notation
- From: Kenny McCormack
- Re: How to convert Infix notation to postfix notation
- From: Richard Heathfield
- Re: How to convert Infix notation to postfix notation
- From: Seebs
- Re: How to convert Infix notation to postfix notation
- Prev by Date: Re: subroutine stack and C machine model
- Next by Date: Re: subroutine stack and C machine model
- Previous by thread: Re: How to convert Infix notation to postfix notation
- Next by thread: Re: How to convert Infix notation to postfix notation
- Index(es):
Relevant Pages
|