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
|
/*
* Copyright (c) 2009, Eric Forgeot
*
* Based on work by Jon Strait
*
* This source code is released for free distribution under the terms of the
* GNU General Public License version 2 or (at your opinion) any later version.
*
* This module contains functions for generating tags for Abc files
* (https://en.wikipedia.org/wiki/ABC_notation).
*/
/*
* INCLUDE FILES
*/
#include "general.h" /* must always come first */
#include <ctype.h>
#include <string.h>
#include "parse.h"
#include "read.h"
#include "vstring.h"
#include "routines.h"
#include "entry.h"
/*
* DATA DEFINITIONS
*/
typedef enum {
K_SECTION,
} AbcKind;
static kindDefinition AbcKinds[] = {
{ true, 's', "section", "sections" },
};
/*
* FUNCTION DEFINITIONS
*/
static void findAbcTags (void)
{
vString *name = vStringNew();
const unsigned char *line;
while ((line = readLineFromInputFile()) != NULL)
{
if (line[0] == 'T') {
vStringCatS(name, " / ");
vStringCatS(name, (const char *) line);
makeSimpleTag(name, K_SECTION);
}
else {
vStringClear (name);
if (! isspace(*line))
vStringCatS(name, (const char*) line);
}
}
vStringDelete (name);
}
extern parserDefinition* AbcParser (void)
{
static const char *const patterns [] = { "*.abc", NULL };
static const char *const extensions [] = { "abc", NULL };
parserDefinition* const def = parserNew ("Abc");
def->kindTable = AbcKinds;
def->kindCount = ARRAY_SIZE (AbcKinds);
def->patterns = patterns;
def->extensions = extensions;
def->parser = findAbcTags;
return def;
}
|
