Fix this tokenizer keeping it as similar as possible class Tokenizer: def __init__(self, input_str): self.tokens = re.findall(r'\d+|(\+|\-|\*|/|sin|cos|\(|\))', input_str) self.position = 0 def get_next_token(self): if self.position >= len(self.tokens): return None token = self.tokens[self.position] self.position += 1 return token def peek_next_token(self): if self.position >= len(self.tokens): return None return self.tokens[self.position]
Fix this tokenizer keeping it as similar as possible class Tokenizer: def __init__(self, input_str): self.tokens = re.findall(r'\d+|(\+|\-|\*|/|sin|cos|\(|\))', input_str) self.position = 0 def get_next_token(self): if self.position >= len(self.tokens): return None token = self.tokens[self.position] self.position += 1 return token def peek_next_token(self): if self.position >= len(self.tokens): return None return self.tokens[self.position]
Here's the fixed tokenizer:
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 | import re class Tokenizer: def __init__(self, input_str): self.tokens = re.findall(r'\d+|\+|-|\*|/|sin|cos|\(|\)', input_str) self.position = 0 def get_next_token(self): if self.position >= len(self.tokens): return None token = self.tokens[self.position] self.position += 1 return token def peek_next_token(self): if self.position >= len(self.tokens): return None return self.tokens[self.position] # Example usage if __name__ == "__main__": input_str = "2 + 3 * sin(4)" tokenizer = Tokenizer(input_str) token = tokenizer.get_next_token() while token is not None: print(token) token = tokenizer.get_next_token() |
I extracted the following code from that output:
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 | import re class Tokenizer: def __init__(self, input_str): self.tokens = re.findall(r'\d+|\+|-|\*|/|sin|cos|\(|\)', input_str) self.position = 0 def get_next_token(self): if self.position >= len(self.tokens): return None token = self.tokens[self.position] self.position += 1 return token def peek_next_token(self): if self.position >= len(self.tokens): return None return self.tokens[self.position] # Example usage if __name__ == "__main__": input_str = "2 + 3 * sin(4)" tokenizer = Tokenizer(input_str) token = tokenizer.get_next_token() while token is not None: print(token) token = tokenizer.get_next_token() |
Running the following program:
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 | import re class Tokenizer: def __init__(self, input_str): self.tokens = re.findall(r'\d+|\+|-|\*|/|sin|cos|\(|\)', input_str) self.position = 0 def get_next_token(self): if self.position >= len(self.tokens): return None token = self.tokens[self.position] self.position += 1 return token def peek_next_token(self): if self.position >= len(self.tokens): return None return self.tokens[self.position] # Example usage if __name__ == "__main__": input_str = "2 + 3 * sin(4)" tokenizer = Tokenizer(input_str) token = tokenizer.get_next_token() while token is not None: print(token) token = tokenizer.get_next_token() answer = Tokenizer('sin(3+2*4)-cos(15)').tokens expected = ['sin', '(', '3', '+', '2', '*', '4', ')', '-', 'cos', '(', '15', ')'] assert answer == expected, f'Wrong answer; got {answer} instead of {expected}' print('All tests passed') |
2
+
3
*
sin
(
4
)
All tests passed
Testing if the previous output contains the string All tests passed
: True