Haskell questions, i need the answers as soon as possible please thank you Consider the following context-free grammar with starting non-terminal Sentence:Sentence ::= NP VP NP | NP VP | VP NP NPNP::= Article NounArticle"a"| "the"| "my"::=Article::=::= "dog" "cat" | "fleas"::= Modal Verb%3DNounVPModal::= "can""will"Modal::=Verb::= "has"| "have" |'want'Is this grammar deterministic?Yes, because it is always clear whether a strings belongs to the language or notYes, because each string can be interpreted only one wayNo, because at least two parse trees correspond to the same stringNo, because it is not determined whether a string is part of the language or notAll of the aboveNone of the aboveI don't know Which of the following regular expressions defines a language over {A,B} containing every string with an even number of A's?O ((A|B)(A|B))*O A*(BA*BA*)*O (AA|B)*О АВАВ)"O All of the aboveNone of the aboveO I don't know

Name: Haskell questions, i need the answers as soon as possible please thank
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Haskell questions, i need the answers as soon as possible please thank you Consider the following context-free grammar with starting non-terminal Sentence:Sentence ::= NP VP NP | NP VP | VP NP NPNP::= Article NounArticle"a"| "the"| "my"::=Article::=: