python 一遍式四则运算
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 | #!/usr/bin/python #coding: utf-8 INTEGER = 'INTEGER' PLUS = '+' MINUS = '-' MUL = '*' DIV = '/' LC = '(' RC = ')' EOF = 'EOF' class Token( object ): def __init__( self , typ, val): self .typ = typ; self .val = val; def __str__( self ): return "Token('{typ}','{val}')" . format (typ = self .typ, val = self .val) def __repr__( self ): return self .__str__() class Lexer( object ): def __init__( self , text): self .text = text self .pos = 0 self .cur_token = None ; self .status = 0 def next_token( self ): if self .pos > len ( self .text) - 1 : return Token(EOF, '') ch = '' while True : ch = self .text[ self .pos] self .pos + = 1 if (ch! = ' ' and ch! = '\t' ): break ; if self .status = = 0 : if ch.isdigit(): self .status = 1 return Token(INTEGER, int (ch + self .next_token().val)) else : return Token(ch, ch) elif self .status = = 1 : if ch.isdigit(): return Token(INTEGER, ch + self .next_token().val) else : self .pos - = 1 self .status = 0 return Token(INTEGER, '') class Interpreter( object ): def __init__( self , lexer): self .lexer = lexer self .cur_token = lexer.next_token() def error( self ): raise Exception( "syntax error" ) def eat( self , typ): tok = self .cur_token if (tok.typ = = typ): self .cur_token = self .lexer.next_token() return tok.val else : self .error() def factor( self ): if ( self .cur_token.typ = = INTEGER): tok = self .cur_token self .eat(INTEGER) return tok.val elif self .cur_token.typ = = LC: self .eat(LC) result = self .expr() self .eat(RC) return result else : self .error() def term( self ): result = self .factor() while self .cur_token.typ in (MUL, DIV): if ( self .cur_token.typ = = MUL): self .eat(MUL) result = result * self .factor() elif ( self .cur_token.typ = = DIV): self .eat(DIV) result = result / self .factor() return result def expr( self ): result = self .term() while self .cur_token.typ in (PLUS, MINUS): if ( self .cur_token.typ = = PLUS): self .eat(PLUS) result = result + self .term() elif ( self .cur_token.typ = = MINUS): self .eat(MINUS) result = result - self .term() return result def main(): print ( "expr2" ) while True : text = raw_input ( "calc> " ) if not text: continue if text = = "exit" : break ; lex = Lexer(text) calc = Interpreter(lex) result = calc.expr() print (result) if __name__ = = "__main__" : main() |
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· DeepSeek如何颠覆传统软件测试?测试工程师会被淘汰吗?