Implement ID3 in a language of your choice and run it on the credit history example from the text. If you use LISP, consider the algorithms and data structures developed in Section 15.13 for suggestions.

Data From Section 15.13:

function parse(grammar_symbol); begin save pointer to current location in input stream; case grammar symbol is a terminal: if grammar_symbol matches the next word in the input stream then return (success) else begin reset input stream; return (failure) end; grammar symbol is a nonterminal: begin retrieve the transition network labeled by grammar symbol; state = start state of network; if transition(state) returns success then return (success) else begin reset input stream; return (failure) end end end end. function transition (current_state); begin case current state is a final state: return (success) current state is not a final state: while there are unexamined transitions out of current state do begin grammar symbol:= the label on the next unexamined transition; if parse(grammar_symbol) returns (success) then begin next_state=state at end of the transition; if transition(next_state) returns success; then return (success) end end return (failure) end end.