The following 9 problems are to be seen as preparation problems for the RERS challenge 2014 and belong in the category of White-Box problems. Information about the other problem categories and their challenge dates can be found on the download page. Problems from former challenges can be downloaded from here:

• RERS 2013 problems
• RERS 2012 problems

Changes (for participants of former editions)

Compared to the problems used for RERS 2013 the error handling has been slightly changed. An error will now be thrown immediately after the input of a wrong input symbol occurred. This is different from the handling before, where an error would only be evident after the input of yet another symbol after the one originally causing the error.
Furthermore the input of any illegal symbol will not cause a specific error, but instead the programs will ignore them in a sense that no state change with an illegal symbol is possible. The output for an illegal symbol will be clearly identifiable.
Additionally the problems do not produce quiesence anymore, so that for every input there will be a guaranteed output.

Future Changes

For the main event at the ISoLA 2014 there is however a different handling of array in planing. Array values can be changed, and the index for an array access may be computed in the future. In the C-code the error label will be directly printed to the error stream. No look-up for the label in the line of termination is necessary anymore.

---

Training Problems

The following problems are equal to problems in the White-Box challenge part. Their size is small and their structure fairly simple so that they conform to the first three problems in that category. For advanced problems please study the other 9 problems on this page.

Alphabet size: 5

Property File: constraints.txt, Tarball: zip

	Plain	Arithmetic	Array
Small, Easy	Problem1.java [int only] Problem1.c P1-solution	Problem2.java [int only] Problem2.c P2-solution	Problem3.java [int only] Problem3.c P3-solution

---

These are general problems that do not conform to current I/O behavior of the challenge (which does not include quiesence anymore) are otherwise highly similar though.

Alphabet size: 6

Property File: constraints.txt, Tarball: zip

	Plain	Arithmetic	Array
Small, Easy	Problem1.java [int only] Problem1.c P1-solution	Problem2.java [int only] Problem2.c P2-solution	Problem3.java [int only] Problem3.c P3-solution
Medium, Moderate	Problem4.java [int only] Problem4.c P4-solution	Problem5.java [int only] Problem5.c P5-solution	Problem6.java [int only] Problem6.c P6-solution
Large, Hard	Problem7.java [int only] Problem7.c P7-solution	Problem8.java [int only] Problem8.c P8-solution	Problem9.java [int only] Problem9.c P9-solution

---