P372: Enumeration of all well-formed parenthesis with length $2n$

P372: Enumeration of all well-formed parenthesis with length $2n$

Input:

An integer $n$.

Output:

All well-formed parenthesis with length $2n$ in lexicographical ordering.

Complexity:

Comment:

Reference:

[Er1983] (Bibtex)