determine the terminal symbols and non-terminal symbols and the start symbols from the following grammar: <program>...

Question

Question

determine the terminal symbols and non-terminal symbols and the start symbols from the following grammar:

<var> ==> a | b | c | d

<term> == > <var>|const

engineering Computer-Science

Answer 1

Answer #1

Terminal symbol :- | , ; , + , -

Non terminal symbol :- program , stmts, stmt, var ,expr , term

Start symbol :- var

Answer 2

Similar Homework Help Questions

Given grammar: <program> --> <stmts> <stmts> --> <stmt> | <stmt> ; <stmts> <stmt> --> <var> =...

Given grammar: <program> --> <stmts> <stmts> --> <stmt> | <stmt> ; <stmts> <stmt> --> <var> = <expr> <var> --> a | b | c | d <expr> --> <term> + <term> | <term> - <term> <term> --> <var> | const Write down the parse tree and left most derivation of: c = a + c
This question concerns the following grammar. program -> { stmts } EOF stmts -> stmt stmts...

This question concerns the following grammar. program -> { stmts } EOF stmts -> stmt stmts | ε stmt -> ID = exp ; | IF ( exp ) stmt exp -> ID tail tail -> + exp | - exp | ε Compute the FIRST and FOLLOW sets for the non-terminals of this grammar.
Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are...

Consider the following grammar (G1) for simple assignment statements. (The symbols in double quotation marks are terminal symbols.) assign → id “ = ” expr id → “A” | “B” | “C” expr → expr “ + ” expr | expr “ ∗ ” expr | “(” expr “)” | id a) Give a (leftmost) derivation for string A = B ∗ A + C. b) Give the parse tree for string A = B ∗ A + C. c)...

Need answer along with detailed explanation: Which of the following are terminal symbols in the grammar...

Need answer along with detailed explanation: Which of the following are terminal symbols in the grammar rule: <term> -> <term> * <factor> | (<term>) | <term> (May contain more than one possible answer) A.) | B.) ( C.) <term> D.) *
Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start...

Consider the following grammar (S, A, B, and C are nonterminal symbols; S is the start symbol; 0 and 1 are terminal symbols): S → AA A → BCB B → B0 | B1 | 0 | 1 C → 00 | 11 Which of the following sentences are in the language generated by the grammar? Show derivations for the sentences that can be generated. If a sentence cannot be generated by the grammar, explain why. a) 10010001 b) 01101101...
Solve the following questions. All questions are mandatory. Q1: What’s wrong in the following grammar? S...

Solve the following questions. All questions are mandatory. Q1: What’s wrong in the following grammar? S → ABC A → aA|aa B → bB|B C → cC|cccc Q2: Describe the strings generated by the following grammar S → aSa S → bSb S → aa S → bb Q3: Consider the following grammar: S → ABC A → aA|a B → bB|b C → cC|c Change the above grammar such that it generates L1={anbmck; n>=3,m>=3,k>=4} Q4: Use the following grammar...

1 Prog-DCs Strnts $ Terminal Regular Expression floatdcl intdcl I intdcl id print "p" id 6...

1 Prog-DCs Strnts $ Terminal Regular Expression floatdcl intdcl I intdcl id print "p" id 6 Stmts- Stmt Simts 8 Strnt →id assign Val Expr 10 Expr → plus Val Expr assign " plus minus inum [0-91 fnum 0-9.0-91 blank ("" 2 I print id I minus Val Expr 12 13 Vai -id 14 15 I inum I fnum (Derivation and parse tree) Consider the above ac grammar, show the derivation and it parse tree of the following ac program
Transform the following left recursive BNF grammar into an equivalent non-left recursive grammar (S and A...

Transform the following left recursive BNF grammar into an equivalent non-left recursive grammar (S and A are nonterminal symbols; S is the start symbol; a and b are terminal symbols): S -> aSb | bAS A -> AaA | bAA | AAa | bAb CAUTION: Make sure ALL left recursion is eliminated.
Name: 3. (10 points) Given grammar: <program> → <stmts> Page: 2 <term> → <var> 1 const...

Name: 3. (10 points) Given grammar: <program> → <stmts> Page: 2 <term> → <var> 1 const 1), write down derivation of: c-5+a 2) What are terminals and what are non-terminals in the grammar? Show a complete parse, including the parse stack contents, input string, and action for the string: id - id + id, using the grammar and parse table below. (10 points) 4. Grammar State id S4 4. T F 5. F (E) R2 S7 R4 R4 R2İR2 Parse...

16. A grammar can be expressed in BNF notation. There are two types of symbols in...

16. A grammar can be expressed in BNF notation. There are two types of symbols in BNF expressions. Non-terminal symbols are typically A. Abstract concepts that need to be further defined B. The symbols that would appear in a grammar file C. The symbols that would appear in a source code file D. Metasymbols that are used by BNF grammar types to help describe rules 17. Which of the following scripting languages is a pure object-oriented language: A.. Ruby B....