instead to parse all possible spellings, it uses just some simple rules
How this parser works
The target is to get a key-value object from an array. A key can be the first element or element prefixed by "-" and "--" (switch).
So the parser loops through the array and looks for keys. After he could detect an a key all next elements will be added as a value of this key until he find another key.
If there is no value, then the key is true (boolean). If there are a lot of values, then the key is an array.