/**
* Turn a hast tree into an nlcst tree.
*
* > 👉 **Note**: `tree` must have positional info and `file` must be a `VFile`
* > corresponding to `tree`.
*
* ##### Notes
*
* ###### Implied paragraphs
*
* The algorithm supports implicit and explicit paragraphs, such as:
*
* ```html
*
* An implicit paragraph.
* An explicit paragraph.
*
* ```
*
* Overlapping paragraphs are also supported (see the tests or the HTML spec for
* more info).
*
* ###### Ignored nodes
*
* Some elements are ignored and their content will not be present in
* **[nlcst][]**: `