Re: [Slightly OT] How to process lightweight text markup languages?

["G.B." <bauhaus@futureapps.invalid>]

On 18.01.15 21:21, Dmitry A. Kazakov wrote:
> This is a pretty
> straightforward and simple technique.

The trouble is with expectations:

Input:

  ((){)([()[[]])]

Typical parsers will respond with such useless results
as "error at EOF". Not something that a (close to)
natural language processor can afford, I think.

What is needed, maybe, is a way to judiciously transcend
the simplicity of a dumb, straight forward stack with REJECT
at the end. The processor should, after all, output text
that is maximally useful because this justifies the effort
in the first place. What syntactical criteria are there,
if any, that could be the input to finding these maxima?

Is context dependence required? A very simple example is
EOL, if there is one: one corrupted line of output is
better than all remaining lines corrupted.

Can "judicious" entail the use of special casing and be
done?

Would it be possible to describe a fixed point so that
the translation functions would close in on this best
result?