Przykłady debug

• In more detail, algorithmic debugging proceeds as follows.

• The parsers for other intermediate languages simplify debugging and experimentation by making it easy to obtain inputs suitable for any given pass.

• Trying to decipher such values during debugging can be quite a challenge.

• In this section, related work on debugging for lazy functional languages will be reviewed and compared with our work.

• To sum up, debugging of lazy functional programs is made difficult by delayed evaluation, counter-intuitive evaluation order and partially evaluated expressions.

• In addition, this ideal shape grammar editor would possess debugging capabilities similar to those found in other language editors.

• Any remaining redexes are instead indicated by '?' meaning that they, for the purpose of debugging, can be assumed to be correct, as discussed above.

• In addition, type inference sometimes provides more useful debugging information.

• The file also contains information about communication restrictions, which is useful for debugging purposes.

• Also, debugging will only be possible if compilation is (efficiently) reversible, so that the grammar writer is able to view familiar structures.

• According to the authors, debugging and maintenance would then mainly consist in modifying the example set.

• In order to be effective, such environments should also have the means to criticize models and simulations, and help learners with debugging them.

• Due to the lack of constraints, the entire stack is necessary for debugging erroneous template instantiations.

• Since interpreters are typically fairly machine-independent, debugging systems based on them are also portable.

• Although our previous work on types and debugging provides the intuition for this paper, we do not rely on any particular definition of inadmissibility here.