static void
translate_springer_abstract_data (tree u, string s, tree &abstract_data) {
if (N(u) < 2) return;
s= "\\abstract-" * s;
array<tree> tmp= tokenize_concat (u[N(u)-1],
A(concat (tree (TUPLE, "\\and"), tree (TUPLE, "\\tmsep"))));
if (N(tmp) > 0) {
tree t= tree (APPLY, s);
t << tmp;
abstract_data << t;
}
}
static array<tree>
unconcat_tmseps (tree t) {
if (is_atomic (t)) return A(concat (t));
array<tree> sep= A(concat (tuple ("\\tmsep"), tuple ("\\tmSep")));
if (need_tokenize (t, sep)) {
array<tree> tmp= tokenize_concat (t[1], sep);
for (int i=0; i<N(tmp); i++)
tmp[i]= tree (L(t), t[0], tmp[i]);
return tmp;
}
tree r(L(t));
for (int i=0; i<N(t); i++) {
r << unconcat_tmseps (t[i]);
}
return A(concat (r));
}
tree
collect_metadata_acm (tree t) {
int i, n=N(t);
tree u, r (CONCAT);
tree doc_data (APPLY, "\\doc-data");
tree abstract_data (APPLY, "\\abstract-data");
array<tree> doc_notes;
for (i=0; i<n; i++) {
u= t[i];
if (is_tuple (u, "\\date", 1))
doc_data << tree (APPLY, "\\doc-date", u[1]);
else if (is_tuple (u, "\\title", 1))
doc_data << tree (APPLY, "\\doc-title", u[1]);
else if (is_tuple (u, "\\title*", 2)) {
doc_data << tree (APPLY, "\\doc-running-title", u[1]);
doc_data << tree (APPLY, "\\doc-title", u[2]);
}
else if (is_tuple (u, "\\subtitle", 1))
doc_data << tree (APPLY, "\\doc-subtitle", u[1]);
else if (is_tuple (u, "\\titlenote", 1))
doc_data << tree (APPLY, "\\doc-note", u[1]);
else if (is_tuple (u, "\\subtitlenote", 1))
doc_data << tree (APPLY, "\\doc-note", u[1]);
else if (is_tuple (u, "\\author", 1)) {
array<tree> authors;
while (i<n && is_tuple (t[i], "\\author", 1))
authors << t[i++][1];
array<tree> author_datas;
while (i<n) {
if (is_tuple (t[i], "\\affiliation", 1)) {
tree aff= get_acm_affiliation (t[i++][1]);
author_datas << tree (APPLY, "\\author-affiliation", aff);
}
else if (is_tuple (t[i], "\\orcid", 1))
i++;
else if (is_tuple (t[i], "\\authornote", 1))
author_datas << tree (APPLY, "\\author-note", t[i++][1]);
else if (is_tuple (t[i], "\\email", 1))
author_datas << tree (APPLY, "\\author-email", t[i++][1]);
else if (t[i] == "" || t[i] == " ")
i++;
else break;
}
for (int j=0; j<N(authors); j++) {
tree author_data (APPLY, "\\author-data");
author_data << tree (APPLY, "\\author-name", authors[j]);
author_data << author_datas;
doc_data << tree (APPLY, "\\doc-author", author_data);
}
i--;
}
else if (is_tuple (u, "\\begin-abstract")) {
tree abstract_text (CONCAT);
i++;
while (i<n && !is_tuple (t[i], "\\end-abstract"))
abstract_text << t[i++];
abstract_data << tree (APPLY, "\\abstract", abstract_text);
}
else if (is_tuple (u, "\\begin-keywords")) {
tree keywords (CONCAT);
i++;
while (i<n && !is_tuple (t[i], "\\end-keywords"))
keywords << t[i++];
array<tree> tmp= tokenize_concat (keywords, A(concat (",", ";",
tree (TUPLE, "\\tmsep"), tree (TUPLE, "\\tmSep"))));
if (N(tmp) > 0) {
tree kw= tree (APPLY, "\\abstract-keywords");
kw << tmp;
abstract_data << kw;
}
}
else if (is_tuple (u, "\\tmmsc") || is_tuple (u, "\\tmarxiv") ||
is_tuple (u, "\\tmpacs"))
abstract_data << collect_abstract_data (u);
else if (is_tuple (u, "\\keywords", 1) || is_tuple (u, "\\terms", 1)) {
array<tree> tmp= tokenize_concat (u[N(u)-1], A(concat (",", ";",
tree (TUPLE, "\\tmsep"), tree (TUPLE, "\\tmSep"))));
if (N(tmp) > 0) {
tree kw= tree (APPLY, "\\abstract-keywords");
kw << tmp;
abstract_data << kw;
}
}
else if (is_tuple (u, "\\category") || is_tuple (u, "\\category*")) {
tree tmp (APPLY, "\\abstract-acm");
for (int j=1; j<N(u); j++) tmp << u[j];
abstract_data << tmp;
}
}
if (N(doc_notes) > 0) doc_data << doc_notes;
if (N(doc_data) > 1) r << doc_data << "\n";
if (N(abstract_data) > 1) r << abstract_data << "\n";
return r;
}
tree
collect_metadata_acm_old (tree t) {
int i, n=N(t);
tree u, r (CONCAT);
tree doc_data (APPLY, "\\doc-data");
tree abstract_data (APPLY, "\\abstract-data");
array<tree> doc_notes;
for (i=0; i<n; i++) {
u= t[i];
if (is_tuple (u, "\\date", 1))
doc_data << tree (APPLY, "\\doc-date", u[1]);
else if (is_tuple (u, "\\title", 1)) {
get_acm_title_notes (u[1], doc_notes);
doc_data << tree (APPLY, "\\doc-title", catm (u[1]));
}
else if (is_tuple (u, "\\subtitle", 1)) {
get_acm_title_notes (u[1], doc_notes);
doc_data << tree (APPLY, "\\doc-subtitle", catm (u[1]));
}
else if (is_tuple (u, "\\author", 1)) {
array<tree> author_datas= get_acm_author_datas (u[1]);
for (int j=0; j<N(author_datas); j++)
doc_data << tree (APPLY, "\\doc-author", author_datas[j]);
}
else if (is_tuple (u, "\\additionalauthors", 1)) {
doc_data << tree (APPLY, "\\doc-author",
tree (APPLY, "\\author-data",
tree (APPLY, "\\author-name", u[1])));
}
else if (is_tuple (u, "\\begin-abstract")) {
tree abstract_text (CONCAT);
i++;
while (i<n && !is_tuple (t[i], "\\end-abstract"))
abstract_text << t[i++];
abstract_data << tree (APPLY, "\\abstract", abstract_text);
}
else if (is_tuple (u, "\\begin-keywords")) {
tree keywords (CONCAT);
i++;
while (i<n && !is_tuple (t[i], "\\end-keywords"))
keywords << t[i++];
array<tree> tmp= tokenize_concat (keywords, A(concat (",", ";",
tree (TUPLE, "\\tmsep"), tree (TUPLE, "\\tmSep"))));
if (N(tmp) > 0) {
tree kw= tree (APPLY, "\\abstract-keywords");
kw << tmp;
abstract_data << kw;
}
}
else if (is_tuple (u, "\\tmmsc") || is_tuple (u, "\\tmarxiv") ||
is_tuple (u, "\\tmpacs"))
abstract_data << collect_abstract_data (u);
else if (is_tuple (u, "\\keywords", 1) || is_tuple (u, "\\terms", 1)) {
array<tree> tmp= tokenize_concat (u[N(u)-1], A(concat (",", ";",
tree (TUPLE, "\\tmsep"), tree (TUPLE, "\\tmSep"))));
if (N(tmp) > 0) {
tree kw= tree (APPLY, "\\abstract-keywords");
kw << tmp;
abstract_data << kw;
}
}
else if (is_tuple (u, "\\category") || is_tuple (u, "\\category*")) {
tree tmp (APPLY, "\\abstract-acm");
for (int j=1; j<N(u); j++) tmp << u[j];
abstract_data << tmp;
}
}
if (N(doc_notes) > 0) doc_data << doc_notes;
if (N(doc_data) > 1) r << doc_data << "\n";
if (N(abstract_data) > 1) r << abstract_data << "\n";
return r;
}
