---
title: A robot follows its steps exactly; a mistake in the steps is called… — Olympiad: thinking like a machine, Bebras puzzle… · tree and pragmatics
description: A robot follows its steps exactly; a mistake in the steps is called a bug, and finding and fixing it is called debugging. Who acts: robot, answer. A sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school with its dependency tree and t
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/11/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [school](https://md.mova.elamur.ai/free/en/corpora/school/) / [AI](https://md.mova.elamur.ai/free/en/corpora/school/ai/) / [Olympiad: thinking like a machine, Beb…](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/) / 11

# Olympiad: thinking like a machine, Bebras puzzles ★★★, sentence 11

<!-- .ven lang=en -->
A robot follows its steps exactly; a mistake in the steps is called a bug, and finding and fixing it is called debugging.

<!-- .vintro -->
**Who acts:** robot, answer · **What happens:** follow, call, find, fix, step · **To what, where:** steps, mistake, answer, debugging · **Speech:** someone speaks here

<!-- .vabout -->
This is a sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school. The page gives its syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause: who acts (robot, answer), what happens, when and where, as Mova's frames read it from the tree.

## The tree {#tree}

```conllu
# sent_id = school:ai:031-olympiad-thinking-like-a-machine.lesson:11
# text = A robot follows its steps exactly; a mistake in the steps is called a bug, and finding and fixing it is called debugging.
# source = school lesson (ours)
# course = ai
# lesson = 031-olympiad-thinking-like-a-machine.lesson
# annotation = Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R6-punct-agree ×1, R7-rel-agree ×1, R8-pos-agree ×1
1	A	a	DET	DT	Definite=Ind|PronType=Art	2	det	_	_
2	robot	robot	NOUN	NN	Number=Sing	3	nsubj	_	_
3	follows	follow	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
4	its	its	PRON	PRP$	Case=Gen|Gender=Neut|Number=Sing|Person=3|Poss=Yes|PronType=Prs	5	nmod:poss	_	_
5	steps	step	NOUN	NNS	Number=Plur	3	obj	_	_
6	exactly	exactly	ADV	RB	_	3	advmod	_	_
7	;	;	PUNCT	:	_	14	punct	_	_
8	a	a	DET	DT	Definite=Ind|PronType=Art	9	det	_	_
9	mistake	mistake	NOUN	NN	Number=Sing	14	nsubj:pass	_	_
10	in	in	ADP	IN	_	12	case	_	_
11	the	the	DET	DT	Definite=Def|PronType=Art	12	det	_	_
12	steps	step	NOUN	NNS	Number=Plur	9	nmod	_	_
13	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	14	aux:pass	_	_
14	called	call	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	3	parataxis	_	Agree=R7-rel-agree|Haiku=3:conj
15	a	a	DET	DT	Definite=Ind|PronType=Art	16	det	_	_
16	bug	bug	NOUN	NN	Number=Sing	14	xcomp	_	_
17	,	,	PUNCT	,	_	24	punct	_	Agree=R6-punct-agree|Haiku=19:punct
18	and	and	CCONJ	CC	_	19	cc	_	_
19	finding	find	VERB	VBG	VerbForm=Ger	24	nsubj:pass	_	_
20	and	and	CCONJ	CC	_	21	cc	_	_
21	fixing	fix	VERB	VBG	VerbForm=Ger	19	conj	_	_
22	it	it	PRON	PRP	Case=Acc|Gender=Neut|Number=Sing|Person=3|PronType=Prs	21	obj	_	_
23	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	24	aux:pass	_	_
24	called	call	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	14	conj	_	_
25	debugging	debug	NOUN	NN	Number=Sing	24	xcomp	_	Agree=R8-pos-agree|Haiku=24:xcomp|HaikuPos=VERB:VBG:VerbForm=Ger
26	.	.	PUNCT	.	_	3	punct	_	_
```

## Pragmatics {#pragmatics}

<!-- .note -->
No stored speech act for this sentence.

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **follow** | present | a robot | answer's steps |  |  |  | exactly *property* | vn chase-51.6 «NP V NP»: agent=Agent step=Theme |
| 2 | **call** | present · passive |  | a mistake in the steps |  |  |  |  | vn initiate\_communication-37.4.2-1 «NP V NP.recipient»: subject=Recipient |
| 3 | **find** | gerund |  |  |  |  |  |  | vn declare-29.4-1-1 «NP V what S\_INF»: agent=Agent |
| 4 | **fix** | gerund |  | answer |  |  |  |  | vn shake-22.3-2 «NP V NP together»: agent=Agent it=Patient |
| 5 | **call** | present · passive |  | debugging |  |  |  |  | vn initiate\_communication-37.4.2-1 «NP V NP.recipient»: subject=Recipient |
| 6 | **step** |  | answer |  |  |  |  |  | nom step «act transitive»: poss=agent |

<!-- .note -->
One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.

<!-- div src -->

**Licence: [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/)**, as the whole of Mova corpus 0.4, of which this treebank (the agreed school, `mova-school-agreed-en.conllu`) is part. The lessons were written for Mova's primary school. Sentence `school:ai:031-olympiad-thinking-like-a-machine.lesson:11`.

**The tree:** Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R6-punct-agree ×1, R7-rel-agree ×1, R8-pos-agree ×1. **The frames** are read from the tree by Mova's frames reader (`prag`) when this page is built, the lesson read in order, so a pronoun may be resolved from an earlier sentence.

See the [release 0.4](https://md.mova.elamur.ai/free/en/releases/0.4/).

<!-- /div -->

<!-- pn -->
- ← previous: [Olympiad: thinking like a machine, Beb…, 10](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/10/)
- next →: [Olympiad: thinking like a machine, Beb…, 12](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/12/)
- ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/)

