Basic block: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Basic block''' --- линейный участок, луч. '''1.''' A '''basic block''' is a sequence of consecutive statements (of a program) such that control…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Basic block''' | '''Basic block''' — ''[[линейный участок]], [[луч]].'' | ||
'''1.''' A '''basic block''' is a sequence of consecutive statements (of a program) such that | '''1.''' A '''basic block''' is a sequence of consecutive statements (of a [[program]]) such that | ||
control flow enters the sequence at the beginning and leaves the sequence | control flow enters the sequence at the beginning and leaves the sequence | ||
at the end without halt or possibility of branching except for the end. | at the end without halt or possibility of branching except for the end. | ||
'''2.''' A simple path <math>P=(p_1,p_2, \ldots, P_r)</math>, <math>r\geq 1</math>, in a control flow graph is called | '''2.''' A [[simple path]] <math>P=(p_1,p_2, \ldots, P_r)</math>, <math>r\geq 1</math>, in a [[control flow graph]] is called | ||
a '''basic block''' (or '''ray''') if <math>p_{i-1}</math> is a single predecessor of | a '''basic block''' (or '''[[ray]]''') if <math>\,p_{i-1}</math> is a single [[predecessor of a vertex|predecessor]] of | ||
<math>p_i</math> and <math>p_j</math> is a single successor of <math>p_{j+1}</math> for all <math>i>1</math> and <math>j<r</math>. | <math>\,p_i</math> and <math>\,p_j</math> is a single [[successor of a vertex|successor]] of <math>\,p_{j+1}</math> for all <math>\,i>1</math> and <math>\,j<r</math>. | ||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
Текущая версия от 16:31, 23 октября 2018
Basic block — линейный участок, луч.
1. A basic block is a sequence of consecutive statements (of a program) such that control flow enters the sequence at the beginning and leaves the sequence at the end without halt or possibility of branching except for the end.
2. A simple path [math]\displaystyle{ P=(p_1,p_2, \ldots, P_r) }[/math], [math]\displaystyle{ r\geq 1 }[/math], in a control flow graph is called a basic block (or ray) if [math]\displaystyle{ \,p_{i-1} }[/math] is a single predecessor of [math]\displaystyle{ \,p_i }[/math] and [math]\displaystyle{ \,p_j }[/math] is a single successor of [math]\displaystyle{ \,p_{j+1} }[/math] for all [math]\displaystyle{ \,i\gt 1 }[/math] and [math]\displaystyle{ \,j\lt r }[/math].
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.