You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If last is true, jump to the step below labeled done.
Let ancestor be node.
Loop: If ancestor is the first node in the stack of open elements, jump to the step below labeled done.
Let ancestor be the node before ancestor in the stack of open elements.
If ancestor is a template node, jump to the step below labeled done.
If ancestor is a table node, switch the insertion mode to "in select in table" and return.
Jump back to the step labeled loop.
Done: Switch the insertion mode to "in select" and return.
If node is a td or th element and last is false, then switch the insertion mode to "in cell" and return.
This text is a little unclear, having actually two algorithms (main and sub-steps of step 4.). Also we have in step 4. sub-steps saying following: "jump to the step below labeled done".
If read literally, it would mean to jump to outer (main) Step 5. "5. If node is a td or th element ...". And if we follow this understanding, we end up having in step 4. sub-step 8. never executed, as step 4. sub-step 7. has text "7. Jump back to the step labeled loop." so we never end in step 4. sub-step 8.
Text needs some clarification or better behavioral algorithmic language (maybe ITU, or ISO standard language style for algorithms like JPEG standard for example).
So is this how algorithm should behave or not!?
Is there any better way of looking the algorithms that are described in html standard?
thank you
The text was updated successfully, but these errors were encountered:
https://html.spec.whatwg.org/multipage/parsing.html#reset-the-insertion-mode-appropriately
This text is a little unclear, having actually two algorithms (main and sub-steps of step 4.). Also we have in step 4. sub-steps saying following: "jump to the step below labeled done".
If read literally, it would mean to jump to outer (main) Step 5. "5. If node is a td or th element ...". And if we follow this understanding, we end up having in step 4. sub-step 8. never executed, as step 4. sub-step 7. has text "7. Jump back to the step labeled loop." so we never end in step 4. sub-step 8.
Text needs some clarification or better behavioral algorithmic language (maybe ITU, or ISO standard language style for algorithms like JPEG standard for example).
So is this how algorithm should behave or not!?
Is there any better way of looking the algorithms that are described in html standard?
thank you
The text was updated successfully, but these errors were encountered: