Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #72.7K
~697 People Reached
Favorite Forums
Community Center
x
1
|
[COLOR=#000000]Write lisp for two functions that manipulate binary search trees. The tree will now be a nested list structure. Inserting 4, 2, 5, 1, 6, 3 should create the list: (4 (2 (1 () ()) (3 () ())) (5 () (6 () ())))[/COLOR] [COLOR=#000000] [/COLOR] [COLOR=#000000] [/COLOR] [COLOR=#000000]1.Write a lisp …
|
|
|
Can anyone help me ? The question is : Write a function to parse a list (sequence) of symbols Determine if the sequence is valid by the following grammar: PROP ::= ATOM | PROP UNIOP | PROP PROP BINOP ATOM ::= 'A' | 'B' | 'C' | 'D' | 'E' … |