fea-rs 0.22.0

Tools for working with Adobe OpenType Feature files.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95

//! syntax for variation syntax.
//!
//! See <https://github.com/adobe-type-tools/afdko/pull/1350>

use crate::parse::{
    Parser,
    lexer::{Kind, TokenSet},
};
use crate::token_tree::Kind as AstKind;

pub(crate) fn condition_set(parser: &mut Parser) {
    // parse a single condition. returns true if we advance the cursor
    // a condition looks like:
    // <tag> <min> <max>;, e.g.
    // wght 100 300;
    fn condition(parser: &mut Parser) -> bool {
        if !parser.matches(0, TokenSet::TAG_LIKE) {
            return false;
        }
        parser.in_node(AstKind::ConditionNode, |parser| {
            parser.expect_tag(TokenSet::TOP_SEMI.add(Kind::Number));
            parser.repeat(|p| p.expect_recover(Kind::Number, TokenSet::TOP_SEMI), 2);
            parser.expect_semi();
        });

        true
    }

    fn condition_set_body(parser: &mut Parser) {
        assert!(parser.eat(Kind::ConditionSetKw));
        // saved for error reporting
        let raw_label_range = parser.matches(0, Kind::Ident).then(|| parser.nth_range(0));
        parser.expect_remap_recover(
            TokenSet::IDENT_LIKE,
            AstKind::Label,
            TokenSet::TOP_LEVEL.add(Kind::LBrace),
        );
        parser.expect(Kind::LBrace);
        while !parser.at_eof() && !parser.matches(0, Kind::RBrace) {
            if !condition(parser) {
                if let Some(range) = raw_label_range {
                    parser.raw_error(range, "Table is unclosed");
                }
                break;
            }
        }
        parser.expect_recover(
            Kind::RBrace,
            TokenSet::TOP_LEVEL.union(TokenSet::IDENT_LIKE.union(TokenSet::SEMI)),
        );
        parser.expect_remap_recover(
            TokenSet::IDENT_LIKE,
            AstKind::Label,
            TokenSet::TOP_LEVEL.union(TokenSet::SEMI),
        );

        parser.expect_semi();
    }

    parser.in_node(AstKind::ConditionSetNode, condition_set_body);
}

pub(crate) fn variation(parser: &mut Parser) {
    fn variation_body(parser: &mut Parser) {
        assert!(parser.eat(Kind::VariationKw));
        let open_tag = parser.expect_tag(TokenSet::TOP_LEVEL.add(Kind::Ident).add(Kind::LBrace));
        if !parser.eat(Kind::NullKw) && !parser.eat_remap(TokenSet::IDENT_LIKE, AstKind::Label) {
            parser.err_recover(
                "expected label or NULL",
                TokenSet::TOP_LEVEL.add(Kind::LBrace),
            );
        }

        parser.expect(Kind::LBrace);

        while !parser.at_eof() && !parser.matches(0, Kind::RBrace) {
            if !super::feature::statement(parser, TokenSet::FEATURE_STATEMENT, false) {
                if let Some(tag) = open_tag.as_ref() {
                    parser.raw_error(tag.range.clone(), "Variation block is unclosed");
                }
                break;
            }
        }
        parser.expect_recover(Kind::RBrace, TokenSet::TOP_SEMI);
        let close_tag = parser.expect_tag(TokenSet::TOP_LEVEL);
        if let (Some(open), Some(close)) = (open_tag, close_tag)
            && open.tag != close.tag
        {
            parser.raw_error(close.range, format!("expected tag '{}'", open.tag));
        }
        parser.expect_semi();
    }

    parser.in_node(AstKind::VariationNode, variation_body);
}