Lexer for tiny language
Write a lexer for a tiny language. Given a source string, produce a list of (type, value) tuples. Token types: 'NUM' for a maximal run of digits (value is the substring), 'ID' for a maximal run of letters/underscores/digits that starts with a letter or underscore (value is the substring), 'OP' for any single character in the set + - * / = ( ) (value is that character). Whitespace (spaces, tabs, newlines) separates tokens and is otherwise ignored. Any other character is invalid: stop and return whatever tokens were produced so far plus a final ('ERR', <the bad char>) tuple. On clean input, no ERR is appended. Return the token list (empty for empty/all-whitespace input).
tokenize(src: str) → list["x = 42 + y1"]out[["ID","x"],["OP","="],["NUM","42"],["OP","+"],["ID","y1"]]State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
["x = 42 + y1"][["ID","x"],["OP","="],["NUM","42"],["OP","+"],["ID","y1"]]not run yetsample