Structure of an AP algorithm

As described above, all of the expressions for deciding a new rate are scoped by statements describing the existing state of the SLC. They must specify for each rate choosing expression, each of the following:

1. Which bgrp's it is pertinent to
2. Which repetition rates that the SLC is currently operating on it is pertinent to
3. Which stoppers, and their existing states, it is pertinent to.

So, including some header information, all AP algorithms have the structure roughly illustrated in figure 2. That is, they are composed of some number of scoping statements followed by an expression, followed by some more scoping statements, followed by another expression, and so on, until the scoping statements have covered all of the possibilities in the SLC for the AP's region, and so given an expression of what to do in every situation.

  
Figure 2: Regular AP algorithm syntax outline

For a full explanation of the syntax that AP algorithms, please refer to the mpsl syntax description in Appendix .