| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | fix spurious newlines |  Peter McGoron
| 2025-01-27 | 3 | -4/+20 |
| | | |||||
| * | expand starts and continues by adding current node as argument | Peter McGoron
| 2025-01-27 | 5 | -80/+91 |
| | | | | | | | | This simplifies the parser at the expense of moving the `add-new-node!` declaration into the `starts` procedure. This allows for the procedure to mutate the node when needed, which is needed for properly parsing pandoc-style grid tables. | ||||
| * | indented code block test | Peter McGoron
| 2025-01-26 | 3 | -14/+81 |
| | | |||||
| * | partial suppor for ATX headings | Peter McGoron
| 2025-01-26 | 4 | -8/+102 |
| | | |||||
| * | fix tight nesting of block quotes | Peter McGoron
| 2025-01-26 | 5 | -10/+61 |
| | | |||||
| * | parsing tests | Peter McGoron
| 2025-01-26 | 3 | -1/+150 |
| | | |||||
| * | remove unordered list containers | Peter McGoron
| 2025-01-26 | 7 | -70/+52 |
| | | | | | | | | | | | | | | | Although it is possible to incorporate automatic detection of list containers in the block parser (look ahead for `* `, if not check for ` `), but I think that this is premature. The point of the block parser is to take the input and figure out what block the item is in. All a list container does is compress together adjacent list items. This can be done in a second pass. (This might have the effect of causing list items separated by line breaks to be in the same list. If there is nothing in between, it would make sense.) | ||||
| * | block structure | Peter McGoron
| 2025-01-25 | 10 | -0/+891 |
 |
index : market | |
| Pseudo-Markdown parser in Scheme | Peter McGoron |
| aboutsummaryrefslogtreecommitdiffstats |