def findmax(f,l): best_element_sofar = None best_f_value_sofar = None for i in range(len(l)-1): elt = l[i] f_value = f(elt) if best_f_value_sofar == None or \ f_value > best_f_value_sofar: best_element_sofar = elt best_f_value_sofar = f_value return best_element_sofar
Modern programming languages like Python can understand hexadecimal
numbers natively! Try it:
print 0x234 # uncomment me to see 564 printed
print 0xb # uncomment me to see 11 printed
import ply.lex as lex
tokens = ('NUM', 'ID')
def test_lexer(input_string):
lexer.input(input_string)
result = [ ]
while True:
tok = lexer.token()
if not tok: break
result = result + [(tok.type,tok.value)]
return result
