开发者

Grammar to recognize postfix formulas

I'm trying to create a postfix to infix converter, and I'm unable to create the grammar for postfix formulas. I've been also looking for it for a while without success..

What grammar开发者_运维知识库 could I use to recognize valid postfix expressions?

The tokens I need are: number, +, * and ^ (pow).


I would suggest

E ::= number | E E + | E E * | E E ^


Valid in what sense? Resulting in one value?

B ::= number | B B O
O ::= + | * | ^
0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜