Re: A reference of the match compiler?
[Thread Prev] | [Thread Next]
[Date Prev] | [Date Next]
- Subject: Re: A reference of the match compiler?
- From: Ori Bernstein <ori@xxxxxxxxxxxxxx>
- Reply-to: myrddin-dev@xxxxxxxxxxxxxx
- Date: Fri, 10 May 2019 11:38:05 -0700
- To: "Mura Li" <mail@xxxxxxx>
- Cc: myrddin-dev@xxxxxxxxxxxxxx
On Fri, 10 May 2019 08:02:33 -0400, "Mura Li" <mail@xxxxxxx> wrote: > >> My question is, *should the Dtree of a match statement contain more than one 'any' node following the design of the algorithm*? Is that expected? > >> As I understand(guess), it means the 'default' case of a switch statement. > >> Am I correct? > >> > Looking closer into it, I realized that I was wrong. > Now, I am seeing it as a placeholder for wildcard variables, representing an unconditional branch (in contrast to a compare/conditional branch). Yep, exactly. -- Ori Bernstein
A reference of the match compiler? | "Mura Li" <mail@xxxxxxx> |
Re: A reference of the match compiler? | Ori Bernstein <ori@xxxxxxxxxxxxxx> |
Re: A reference of the match compiler? | "Mura Li" <mail@xxxxxxx> |
Re: A reference of the match compiler? | "Mura Li" <mail@xxxxxxx> |
- Prev by Date: Re: A reference of the match compiler?
- Previous by thread: Re: A reference of the match compiler?
- Index(es):