Issue with list-table

[asmeurer]

I am trying to convert my site asmeurer/brown-water-python#2 from recommonmark to Myst.

One issue I'm having so far is with a list-table.

You can see how the table renders with recommonmark here, which is how I like it. Myst renders it like this.

You can see how I modified it for Myst here asmeurer/brown-water-python@1395106.

There are two problems

• The table proportions are off. It decided to make the left and right columns small and the middle column wide, instead of equally wide.
• The rst link in the last row doesn't work.

[chrisjsewell]

The rst link in the last row doesn't work.

That's because it should be written in Markdown. Another thing that should be stressed in the documentation, is that all "nested" content in directives will be parsed as markdown, not rST.
i.e. `garbage in, garbage out <https://en.wikipedia.org/wiki/Garbage_in,_garbage_out>`_, should be [garbage in, garbage out](https://en.wikipedia.org/wiki/Garbage_in,_garbage_out). This is IMO the major advantage over recommonmark; no switching between rST and Markdown.

[chrisjsewell]

Once you fix the link, I think they will look exactly the same:

MyST

Regular expressions	tokenize	ast
Can work with incomplete or invalid Python.	Can work with incomplete or invalid Python, though you may need to watch for ERRORTOKEN and exceptions.	Requires syntactically valid Python (with a few minor exceptions).
Regular expressions can be difficult to write correctly and maintain.	Token types are easy to detect. Larger patterns must be amalgamated from the tokens. Some tokens mean different things in different contexts.	AST has high-level abstractions such as ast.walk and NodeTransformer that make visiting and transforming nodes easy, even in complicated ways.
Regular expressions work directly on the source code, so it is trivial to do lossless source code transformations with them.	Lossless source code transformations are possible with tokenize, as all the whitespace can be inferred from the TokenInfo tuples. However, it can often be tricky to do in practice, as it requires manually accounting for column offsets.	Lossless source code transformations are impossible with ast, as it completely drops whitespace, redundant parentheses, and comments (among other things).
Impossible to detect edge cases in all circumstances, such as code that actually is inside of a string.	Edge cases can be avoided. Differentiates between actual code and code inside a comment or string. Can still be fooled by invalid Python (though this can often be considered a garbage in, garbage out scenario).	Edge cases can be avoided effortlessly, as only valid Python can even be parsed, and each node class represents that syntactic construct exactly.

Recommonmark

Regular expressions	tokenize	ast
Can work with incomplete or invalid Python.	Can work with incomplete or invalid Python, though you may need to watch for ERRORTOKEN and exceptions.	Requires syntactically valid Python (with a few minor exceptions).
Regular expressions can be difficult to write correctly and maintain.	Token types are easy to detect. Larger patterns must be amalgamated from the tokens. Some tokens mean different things in different contexts.	AST has high-level abstractions such as ast.walk and NodeTransformer that make visiting and transforming nodes easy, even in complicated ways.
Regular expressions work directly on the source code, so it is trivial to do lossless source code transformations with them.	Lossless source code transformations are possible with tokenize, as all the whitespace can be inferred from the TokenInfo tuples. However, it can often be tricky to do in practice, as it requires manually accounting for column offsets.	Lossless source code transformations are impossible with ast, as it completely drops whitespace, redundant parentheses, and comments (among other things).
Impossible to detect edge cases in all circumstances, such as code that actually is inside of a string.	Edge cases can be avoided. Differentiates between actual code and code inside a comment or string. Can still be fooled by invalid Python (though this can often be considered a garbage in, garbage out scenario).	Edge cases can be avoided effortlessly, as only valid Python can even be parsed, and each node class represents that syntactic construct exactly.

[asmeurer]

Ah gotcha, the code from the invalid link was messing up the table width.

[chrisjsewell]

I believe this is now fixed