edited by
336 views
0 votes
0 votes

Which of the following statements are $\text{FALSE}?$

  1. Ambiguous grammars must have more than one parse tree for every string.
  2. Addition(+), subtraction(-), and assignment(=) operators in $\text{C}$ are left associative.
  3. Python is a weekly typed language.
  1. $1$ and $2$
  2. $2$ and $3$
  3. $1$ and $3$
  4. $1, 2$ and $3$
edited by

1 Answer

1 votes
1 votes

(1) ambiguous grammar must have more than one parse tree for atleast one string

(2) + and - are left associative and = is right associative.

(3)

Answer:

Related questions

0 votes
0 votes
1 answer
2
admin asked Jan 5, 2019
372 views
The following grammar $\text{G}$ is left recursive.$\text{E} \rightarrow \text{E + T}\; \mid \; \text{T} $$\text{T} \rightarrow \text{T * F} \; \mid \; \text{F} $$\text{F...
1 votes
1 votes
0 answers
3
admin asked Jan 5, 2019
269 views
Match all items in Group $1$ with correct options from those given in Group $2.$$$\begin{array} {|l|l|} \hline \qquad \qquad \textbf{Group 1} & \qquad \textbf{Group 2} \\...
1 votes
1 votes
0 answers
4
admin asked Jan 5, 2019
278 views
Which phase during compilation does a compiler recognize the $\textbf{keywords}$ of a language?Code generationParsingDataflow analysisLexical analysis