Plz design NFA digram of ( for loop syntax of any programming language) I need the NFA digram with the transition table.  I don't want the syntax writing as code , I want the NFA digram of the syntax it self.

Why do compilers use parsing techniques that are only efficient for a portion of all grammars?

2.  Write a Scheme function numofatoms that determines the number of elements in a list. For example, (numOfSymbols '((1 3) 7 (4 (5 2) ) ) should return 6.

Briefly describe the behavior of the Lisp/Scheme read-eval-print loop.

A.  Write a Scheme function that returns the number of zeros in a given simple list of numbers.B.  Write a Scheme function that returns the reverse of its simple list parameter.C.  Write a Scheme predicate function that tests for the structural equality of two given lists. Two lists are structurally       equal if they have the same list structure, although their atoms may be different.

Describe the differences between code in a decision (if) structure and code in a sequence structure. Answer:

how you would add the symbol "-" minus to the alphabet of the LR parsing table means "HOW" you would do it , what would you use as a template? How would you walk through the process and would you have to add to the grammar as well? if so, what would you add?

Answer questions 1-5 using scheme language this the second time I am posting and you guys use the wrong language. If it is the wrong language once again. I will simply cancel this account 1. Write a SCHEME function, named (tree-size T), which takes a tree node, T, and returns the size (i.e. the number of nodes) of the tree rooted at T. 2. Write a SCHEME function named (tree-depth T) which takes a tree node, T, as a parameter and returns the depth of the tree rooted at T. For the purpose of this exercise, the depth of a tree rooted at T is one plus the maximum of the depths of its two children. 3. Define a SCHEME function named (count-pred P tree) which given a binary tree and predicate function, P, applies the predicate to each of the values in the tree and returns the number of values for which the predicate returns #t (true). 4. Define a SCHEME function named count-one-child which returns the number of internal nodes of a binary tree which have exactly one child. Binary Search Trees…