puzzle contents
raw puzzle

Original Problem

At CodinGame we like to reinvent things. XML, JSON etc. that’s great, but for a better web, we’ve invented our own text data format (called CGX) to represent structured information.

Here is an example of data structured with CGX:

Example of CGX formatted content.
Graphical representation of the example.

CGX content is composed of ELEMENTs.

An ELEMENT can be of any of the following types BLOCK, PRIMITIVE_TYPE or KEY_VALUE.

A sequence of ELEMENTs separated by the character ;
A BLOCK starts with the marker ( and ends with the marker ).

A number, a Boolean, null, or a string of characters (surrounded by the marker ')

A string of characters separated from a BLOCK or a PRIMITIVE_TYPE by the character =

Your mission: write a program that formats CGX content to make it readable!

Beyond the rules below, the displayed result should not contain any space, tab, or carriage return. No other rule should be added.​

Line 1: The number N of CGX lines to be formatted
The N following lines: The CGX content. Each line contains maximum 1000 characters. All the characters are ASCII.

The formatted CGX content

The CGX content supplied will always be valid.
The strings of characters do not include the character '
0 < N < 10000


Even if regular expressions are given as a hint, it doesn't make sense to parse a nested structure with regular expressions (since an infinite recursion can't be modeled with a finate state machine, from which follows it's not a type 3 grammer and as such no regular expression can be found). A better approach is tokenizing all valid symbols of CGX and write it to stdout with a clean formatting. This can be separated into two steps, the tokenizing and formatting step, or we write out the data as we get it in. Let's analyze the grammer for this problem. If we get a quote, we need to continue searching until we get the closing quote. Every character in between can be pushed out directly. If we see any whitespace, we simply ignore it. If we get a semicolon, we print it, followed by a new line. If we get an opening bracket, we write a new line character, if we haven't previously printed one. After that, the current indent and the bracket can follow. Almost the same applies for a closing bracket, but in reverse.

As we want to re-format the string only, no context knowledge is needed. Any other token can be printed as is, which results in the following C++ implementation:

#include <iostream>

using namespace std;

int main() {

  int INDENT = 0;
  bool IN_STRING = false;
  bool NEWLINE = true;
  int n;

  cin >> n;
  cin >> noskipws;

  for (char c; cin >> c; ) {
    if (IN_STRING) {
      IN_STRING = (c != '\'');
      cout << c;
    } else switch (c) {
      case '(':
        if (!NEWLINE)
          cout << endl;
        cout << string(INDENT, ' ') << c << endl;
        INDENT+= 4;
        NEWLINE = true;
      case ')':
        if (!NEWLINE)
          cout << endl;
        INDENT-= 4;
        NEWLINE = false;
        cout << string(INDENT, ' ') << c;
      case '\'':
        cout << string(NEWLINE * INDENT, ' ') << c;
        IN_STRING = true;
        NEWLINE = false;
      case ';':
        cout << c << endl;
        NEWLINE = true;
      case ' ':
      case '\t':
      case '\n':
        cout << string(NEWLINE * INDENT, ' ') << c;
        NEWLINE = false;

All images are copyright to Codingame