recategorized by
821 views
1 1 vote

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

  1. Context-free grammar can be used to specify both lexical and syntax rules.
  2. Type checking is done before parsing
  3. High level language programs can be translated to different Intermediate Representations
  4. Arguments to a function can be passed using the program stack

2 Answers

1 1 vote

The false statement is:

Type checking is done before parsing.

Type checking occurs after parsing, during semantic analysis.

Answer:
Position:
Show:

Related questions

1 1 vote
1 1 answer
750
750 views
gatecse asked Dec 9, 2020
750 views
Which of the following is not true for tree and graph?A tree is a graphA graph is a treeTree can have a cycleTree is a $\text{DAG}$
1 1 vote
1 1 answer
736
736 views
gatecse asked Dec 9, 2020
736 views
Peephole optimization is a :Loop optimizationLocal optimizationConstant foldingData flow analysis
1 1 vote
1 1 answer
712
712 views
gatecse asked Dec 9, 2020
712 views
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________.Shift-reduce conflictShift-Shift conflictBoth “Shift-reduce conflict” & “Shift-Shift conflict”N...
1 1 vote
2 2 answers
768
768 views
gatecse asked Dec 9, 2020
768 views
Shift reduce parsing can also be called as:Reverse of the Right Most DerivationRight Most DerivationLeft Most DerivationNone of the options