Apply BSD license to the newly added notes in the documentation.
Chris Pressey
7 months ago
0 | 0 |
Desugaring Repetition in Fountain
|
1 | 1 |
=================================
|
|
2 |
|
|
3 |
<!--
|
|
4 |
Copyright (c) 2023-2024 Chris Pressey, Cat's Eye Technologies
|
|
5 |
This file is distributed under a BSD license. See LICENSES directory:
|
|
6 |
SPDX-License-Identifier: LicenseRef-BSD-2-Clause-X-Fountain
|
|
7 |
-->
|
2 | 8 |
|
3 | 9 |
The repetition construct `{ ... }` defines a loop in Fountain. We would
|
4 | 10 |
like to regard it as syntactic sugar for recursion. However, due to the
|
0 | 0 |
Lookahead Assertions
|
1 | 1 |
====================
|
|
2 |
|
|
3 |
<!--
|
|
4 |
Copyright (c) 2023-2024 Chris Pressey, Cat's Eye Technologies
|
|
5 |
This file is distributed under a BSD license. See LICENSES directory:
|
|
6 |
SPDX-License-Identifier: LicenseRef-BSD-2-Clause-X-Fountain
|
|
7 |
-->
|
2 | 8 |
|
3 | 9 |
Fountain has (or will have) a general notion of lookahead assertions.
|
4 | 10 |
|