In attributed grammars what is an attribute computation function? A function associated with a production rule used to compute the value of an attribute. A function associated with a production used to check the value of an attribute. A function associated with a symbol used to check the value of an attribute. A function associated with a symbol used to compute the value of an attribute.

(1) Fill the blanks to complete the following sentences that describe the relations between regular expression, regular language, and regular gramma. You can also use your own statements to describe the relations. there is an NFA machine to (i) A language L is regular (ii) A language L is regular (ii1)A language L is regular it. there is a regular expression r to it. there is a regular grammar G to it.

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…

I need help with my context free language. It needs to do the following 1. Developing a language model based on the context-free grammar: Use the context-free grammar to develop a language model that can be used to generate coherent and grammatically correct sentences in American English.2. Incorporating semantic information into the context-free grammar: Expand the context- free grammar to incorporate semantic information, such as word meaning and context, to generate more meaningful sentences in American English. here is my Java code  import java.util.*;import java.util.stream.Collectors; public class CFG {    private static Map<String, List<String>> rules;     public static void main(String[] args) {        rules = new HashMap<>();        initializeGrammarRules();         String sentence = generateSentence("S");        System.out.println(sentence);    }     private static void initializeGrammarRules() {        rules.put("S", Arrays.asList("NP VP"));…