value of each property will be the name of a function that implements the match. Here are
Question:
value of each property will be the name of a function that implements the match.
Here are the table entries to implement the grammar listed previously:
( s e t f (get ' ? i s 'single-match) 'match-is)
( s e t f (get '?or 'single-match) 'match-or)
( s e t f . (get '?and 'single-match) 'match-and)
( s e t f (get '?not 'single-match) 'match-not)
( s e t f (get '?* 'segment-match) 'segment-match)
( s e t f (get '?+ 'segment-match) 'segment-match+)
( s e t f (get '?? 'segment-match) 'segment-match?)
( s e t f (get ' ? i f 'segment-match) 'match-if)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Paradigms Of Artificial Intelligence Programming Case Studies In Common Lisp
ISBN: 9781558601918
1st Edition
Authors: Peter Norvig
Question Posted: