TSLSYNTAX

Chomsky Normal Form: Most useful grammars can be translated into a nor-mal form making answers to questions about the language more transparent.

Syntax and Semantics

Exam Saved 39 Required information NOTE: This is a multi-part question, Once an answer is submitted, you will be unable to return to this part Let G= (V, T, S, P be the phrase-structure grammar with V= (0. 1, A, S). T= (0, 1) and a set of productions Pconsisting of S - 1S, S- 00A, A QA, and A O. S 01:01:19 Identify the correct step to show that 111000 belongs to the language generated by G. Multiple Choice S- SO - S00 - S000 - 11A000 - 111000 S- 1S- 11S- 111S- 11100A - 111000 z Tools S- OS- 10s- 000S - 11100A- 111000 S- 15- 10S- 101S- 11100A - 111000 L...

Discuss different types of Grammar. NOTE: Answer Should Not Be Palgrised

Question 2: The following context-free grammar describes part of the syntax of a simple programming language. Non-terminals are given in capitals and terminals in lower case. VAR represents a variable name and CONST represents a constant. The productions for ASSN-STMT are not given, as they do not affect the question.   1          PROGRAM     →     Procedure STMT-LIST   2          STMT-LIST     →    STMT STMT-LIST   3                                  | STMT   4          STMT → do VAR = CONST to CONST { STMT-LIST }   5                                 | ASSN-STMT   Q) Create attribute(s) and add semantic functions to the above grammar. Write them beside the productions above.

Study the following program:  a(A,[A|B]). a(A,[C|B]) :- a(A,B). Explain in clear steps how Prolog evaluates the following query using the above program: a(b,[c,d,b,f].

Can anyone give me some explanations please? Please answer all A, B and C Suppose that in some programming language numbers are restricted as follows: (a) a number may be signed or unsigned. (b) the value field consists of two nonempty parts, separated by a decimal point. (c) there is an optional exponent field. If present this field must contain the letter e, followed by a signed two-digit integer. Design a grammar for the such numbers in this programming language.

Context free grammar

Translate the following sentences into FOL (use Prover9 syntax). Use the following predicates:  Is(x,y) where x is an animal and y is Mammal, Bird, Fish, Reptile, or Dolphin  Warm_Blooded(x), Cold_Blooded(x)  Lives_In(x,y), where x is an animal and y is a place, e.g. Sea  1) An animal cannot be both warm-blooded and cold-blooded.  2) Dolphins are warm-blooded.  3) Dolphins live in the sea.  4) Flipper is a Dolphin.

Q-5)

Topic: Concepts of programming Language Perform the pairwise disjointness test for the following grammar rules. (please give a few details)i. S → aSb|bAAii. A → b{aB}|biii. B → aB|bA

translate the following sentences into FOL (use Prover9 syntax). Use the following predicates:  Is(x,y) where x is an animal and y is Mammal, Bird, Fish, Reptile, or Dolphin  Warm_Blooded(x), Cold_Blooded(x)  Lives_In(x,y), where x is an animal and y is a place, e.g. Sea    a) An animal is warm-blooded if and only if it is a mammal or a bird.  b) An animal is cold-blooded if and only if it is a fish or a reptile.  c) Animals that live in the sea are either fish or mammals.  d) An animal cannot be both warm-blooded and cold-blooded.  e) Dolphins are warm-blooded.  f) Dolphins live in the sea.  g) Flipper is a Dolphin.

2. Write a compound sentence that joins the clauses with a semicolon 3. Write a compound sentence that joins the clauses with a coordinating conjunction

Sentence 1: The pigpen was built by the barn. Sentence 2: The pigpen was built by the farmer. How do the results of parsing the following two sentences differ? How do the results of semantic analysis differ?

Backus Naur Form (BNF) is a standard notation for expressing syntax as a set of grammar rules. Figure 1 below shows a grammar for assignment with arithmetic operations, e.g. y = (2*x + 5)*x - 7; assignment => ID = expression ; expression => expression + term I expression - term I term term term * factor | term / factor | factor ( expression ) | ID | NUMBER factor => Figure 1. Grammar (a) Identify and list all the non-terminal symbols in the grammar (b) Identify and list all the terminal symbols in the grammar

Build a context-free grammar. Use the usual notation to build the grammar that recognizes the FOR loop in the java and python languages. Please Explain

Please define "static semantics." Please list BNF-difficult static semantics standards. Thanks.

25 ! Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Let G=(V, T, S, P) be the phrase-structure grammar with V= {0, 1, A, S), T = [0, 1] and a set of productions P consisting of S → 1S, S→ 00A, A → OA, and A → 0. Identify the correct step to show that 111000 belongs to the language generated by G. Multiple Choice S→ OS 10S 000S-11100A → 111000 S→15 11S→ 111S→ 11100A → 111000 S→ SO → SOO → S000114000 → 111000 S→ 1S 10S→ 1015 → 11100A → 111000

Please written by computer source

Please help with this modification:2. Use the logic in that program to design your own Recursive Descent parser in C for the following grammar:S →aABA →Abc | bB →d3. Make sure that you choose at least two strings that pass the grammar and one string that does not pass the grammar just like I did in the model program4. Submit both the code and a screen shot of your results for the choice of strings that you provided. Below is the C code that can be used to implement a Recursive Descent parser for the above grammar/* Recursive Descent Parser for the Expression Grammar:S → (L) |aL' →,SL'|εL → SL'Valid inputs: (a,(a,a)) and (a,((a,a),(a,a)))Invalid inputs:(aa,a)*/#include <stdio.h>#include <string.h>int S(), Ldash(), L();char *ip;char string[50];int main()               {printf("Enter the string\n");scanf("%s", string);ip = string;printf("\n\nInput\t\tAction\n ------------------------------\n");if…

Question-2 Write a Prolog predicate "encode(String, Key, Encode)" that encodes a given string to a cypher code using a key.The encode/3 predicate has three arguments1. String - The given string which is to be encoded (Input character range 'a' to 'z')2. Key - A number used for encoding3. Encode - The cypher code generatedThe cypher code for any character is the sum of the ASCII value of that character and the key, but the resultant cypher code must be in the range of 'a' to 'z'.Resources:1. atom_codes(Atom, CodeList)Convert between an atom and a list of corresponding ASCII codes.2. char_code(Atom, Code)Convert between a single character (an atom of length 1), and its ASCII character code.Sample Query:?- encode(apple, 10, E).?- encode(zoo, 10, E).Sample Output:E = kzzvoE = jyy

A database of Prolog facts for a group of people contains the following two types of facts: male([, , ... ] ). female ([, , ... ] ). age( , ) E.g., male([alex, tom, vic, ...]). E.g., female([ann, sara, ella, ..]). E.g. age(ann, 66). For these facts write the following rules (you may use Prolog library functions): person(, ). gender(, gender>). oldest(, , ). meanAgeM(). count(, , ). Find the name and the age of a person Find the name and the gender (male or female) Find the name/age/gender of the oldest person Find the mean age of male people Find the number of male, female, and total people

4. What is the advantage and disadvantage for interpretation? Ans: 5. Please demonstrate abstract syntax and concrete syntax for "3+5 ". Ans:

What is the meaning of capital formation, write the detailed note about capital formation in nutshell sentences?

Q3: Design a minimized CFG grammar then write a Visual Prolog program that describes commands related to moving a car. The grammar should accept queries of these forms: 1- "move", followed by a direction (up, down, right, or left), optionally followed by an adverb describing speed (quickly, rapidly, or slowly). 2- "enter", followed by the, followed by a noun (park or garage). 3- "exit", followed by the, followed by a noun (park or garage).

Context Free Grammars

Context Free Grammars

Discrete Structures Problem: Negated and Nested Quantifiers

Which of these does not belong to Context-Free Grammar (CFG)? a) Terminal Symbolb) Nonterminal Symbolc) Start symbold) End Symbol

24. Suppose that you are defining a grammar for scientific notation numbers. (Ex: "1.3e+5"). What are supposed to be the terminals in this language? (Tip: try to use a float point representation using regular expression).

1. Design a computer programming language Grammar, with the following characteristics: Left Recursion (Left Regular Grammar). Must have between 4 and 5 rules. Define the terminal symbols or tokens.

Define B is a semantic consequence of A & B is a syntactic consequence of A.