Skip to content
Try on iPad

Context-free languages: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.4.3 Context-free languages, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q02.2

    November 2020 · Paper 1

    1 mark4.4.3 Context-free languages
    The whole paper ↗
    November 2020 Paper 1, question 02.2: There are two rules in Figure 2 with <sentence> on the left-hand side that are used to define what a valid sentence is in the language. Write a single rule that

  2. Q02.3

    November 2020 · Paper 1

    1 mark4.4.3 Context-free languages
    The whole paper ↗
    November 2020 Paper 1, question 02.3: Complete the unshaded cells of Table 2 to show which of the strings are valid sentences for the language defined by the BNF rules in Figure 2 Table 2 String Val

  3. Q02.4

    November 2020 · Paper 1

    1 mark4.4.3 Context-free languages
    The whole paper ↗
    November 2020 Paper 1, question 02.4: The sentence dog slept is not currently valid in the language defined in Figure 2 Change the language defined in Figure 2 by either adding or modifying exactly

  4. Q02.5

    November 2020 · Paper 1

    2 marks4.4.3 Context-free languages
    The whole paper ↗
    November 2020 Paper 1, question 02.5: State the number of different sentences defined by the rule: <sentence> ::= <np><v><c><np><v> You should only use the rules in Figure 2 when working out your an

  5. Q02.6

    November 2020 · Paper 1

    1 mark4.4.3 Context-free languages
    The whole paper ↗
    November 2020 Paper 1, question 02.6: State how many more sentences are defined by the rule: <sentence> ::= <sentence><c><sentence> than by the rule: <sentence> ::= <np><v><c><np><v> [1 mark]
All 5 questions on Context-free languages, as a list
  1. November 2020, Paper 1, Q02.2 (1 mark): There are two rules in Figure 2 with <sentence> on the left-hand side that are used to define what a valid sentence is in the language. Write a single rule that
  2. November 2020, Paper 1, Q02.3 (1 mark): Complete the unshaded cells of Table 2 to show which of the strings are valid sentences for the language defined by the BNF rules in Figure 2 Table 2 String Val
  3. November 2020, Paper 1, Q02.4 (1 mark): The sentence dog slept is not currently valid in the language defined in Figure 2 Change the language defined in Figure 2 by either adding or modifying exactly
  4. November 2020, Paper 1, Q02.5 (2 marks): State the number of different sentences defined by the rule: <sentence> ::= <np><v><c><np><v> You should only use the rules in Figure 2 when working out your an
  5. November 2020, Paper 1, Q02.6 (1 mark): State how many more sentences are defined by the rule: <sentence> ::= <sentence><c><sentence> than by the rule: <sentence> ::= <np><v><c><np><v> [1 mark]

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.