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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
# -*- ruby -*-
# vi: set ft=ruby :
# Copyright (C) 2012 President and Fellows of Harvard College
# Copyright (C) 2013-2014 Sylvester Keil
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER ``AS IS'' AND ANY EXPRESS OR
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
# EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
# OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
# NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
# EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#
# The views and conclusions contained in the software and documentation are
# those of the authors and should not be interpreted as representing official
# policies, either expressed or implied, of the copyright holder.
class Namae::Parser
token COMMA UWORD LWORD PWORD NICK AND APPELLATION TITLE SUFFIX
expect 0
rule
names : { result = [] }
| name { result = [val[0]] }
| names AND name { result = val[0] << val[2] }
name : word { result = Name.new(:given => val[0]) }
| display_order
| honorific word { result = val[0].merge(:family => val[1]) }
| honorific display_order { result = val[1].merge(val[0]) }
| sort_order
honorific : APPELLATION { result = Name.new(:appellation => val[0]) }
| TITLE { result = Name.new(:title => val[0]) }
display_order : u_words word opt_suffices opt_titles
{
result = Name.new(:given => val[0], :family => val[1],
:suffix => val[2], :title => val[3])
}
| u_words NICK last opt_suffices opt_titles
{
result = Name.new(:given => val[0], :nick => val[1],
:family => val[2], :suffix => val[3], :title => val[4])
}
| u_words NICK von last opt_suffices opt_titles
{
result = Name.new(:given => val[0], :nick => val[1],
:particle => val[2], :family => val[3],
:suffix => val[4], :title => val[5])
}
| u_words von last
{
result = Name.new(:given => val[0], :particle => val[1],
:family => val[2])
}
| von last
{
result = Name.new(:particle => val[0], :family => val[1])
}
sort_order : last COMMA first
{
result = Name.new({ :family => val[0], :suffix => val[2][0],
:given => val[2][1] }, !!val[2][0])
}
| von last COMMA first
{
result = Name.new({ :particle => val[0], :family => val[1],
:suffix => val[3][0], :given => val[3][1] }, !!val[3][0])
}
| u_words von last COMMA first
{
result = Name.new({ :particle => val[0,2].join(' '), :family => val[2],
:suffix => val[4][0], :given => val[4][1] }, !!val[4][0])
}
;
von : LWORD
| von LWORD { result = val.join(' ') }
| von u_words LWORD { result = val.join(' ') }
last : LWORD | u_words
first : opt_words { result = [nil,val[0]] }
| words opt_comma suffices { result = [val[2],val[0]] }
| suffices { result = [val[0],nil] }
| suffices COMMA words { result = [val[0],val[2]] }
u_words : u_word
| u_words u_word { result = val.join(' ') }
u_word : UWORD | PWORD
words : word
| words word { result = val.join(' ') }
opt_comma : /* empty */ | COMMA
opt_words : /* empty */ | words
word : LWORD | UWORD | PWORD
opt_suffices : /* empty */ | suffices
suffices : SUFFIX
| suffices SUFFIX { result = val.join(' ') }
opt_titles : /* empty */ | titles
titles : TITLE
| titles TITLE { result = val.join(' ') }
---- header
require 'singleton'
require 'strscan'
---- inner
include Singleton
attr_reader :options, :input
def initialize
@input, @options = StringScanner.new(''), {
:debug => false,
:prefer_comma_as_separator => false,
:comma => ',',
:stops => ',;',
:separator => /\s*(\band\b|\&|;)\s*/i,
:title => /\s*\b(sir|lord|count(ess)?|(gen|adm|col|maj|capt|cmdr|lt|sgt|cpl|pvt|prof|dr|md|ph\.?d)\.?)(\s+|$)/i,
:suffix => /\s*\b(JR|Jr|jr|SR|Sr|sr|[IVX]{2,})(\.|\b)/,
:appellation => /\s*\b((mrs?|ms|fr|hr)\.?|miss|herr|frau)(\s+|$)/i
}
end
def debug?
options[:debug] || ENV['DEBUG']
end
def separator
options[:separator]
end
def comma
options[:comma]
end
def stops
options[:stops]
end
def title
options[:title]
end
def suffix
options[:suffix]
end
def appellation
options[:appellation]
end
def prefer_comma_as_separator?
options[:prefer_comma_as_separator]
end
def parse(input)
parse!(input)
rescue => e
warn e.message if debug?
[]
end
def parse!(string)
input.string = normalize(string)
reset
do_parse
end
def normalize(string)
string = string.strip
string
end
def reset
@commas, @words, @initials, @suffices, @yydebug = 0, 0, 0, 0, debug?
self
end
private
def stack
@vstack || @racc_vstack || []
end
def last_token
stack[-1]
end
def consume_separator
return next_token if seen_separator?
@commas, @words, @initials, @suffices = 0, 0, 0, 0
[:AND, :AND]
end
def consume_comma
@commas += 1
[:COMMA, :COMMA]
end
def consume_word(type, word)
@words += 1
case type
when :UWORD
@initials += 1 if word =~ /^[[:upper:]]+\b/
when :SUFFIX
@suffices += 1
end
[type, word]
end
def seen_separator?
!stack.empty? && last_token == :AND
end
def suffix?
!@suffices.zero? || will_see_suffix?
end
def will_see_suffix?
input.peek(8).to_s.strip.split(/\s+/)[0] =~ suffix
end
def will_see_initial?
input.peek(6).to_s.strip.split(/\s+/)[0] =~ /^[[:upper:]]+\b/
end
def seen_full_name?
prefer_comma_as_separator? && @words > 1 &&
(@initials > 0 || !will_see_initial?) && !will_see_suffix?
end
def next_token
case
when input.nil?, input.eos?
nil
when input.scan(separator)
consume_separator
when input.scan(/\s*#{comma}\s*/)
if @commas.zero? && !seen_full_name? || @commas == 1 && suffix?
consume_comma
else
consume_separator
end
when input.scan(/\s+/)
next_token
when input.scan(title)
consume_word(:TITLE, input.matched.strip)
when input.scan(suffix)
consume_word(:SUFFIX, input.matched.strip)
when input.scan(appellation)
[:APPELLATION, input.matched.strip]
when input.scan(/((\\\w+)?\{[^\}]*\})*[[:upper:]][^\s#{stops}]*/)
consume_word(:UWORD, input.matched)
when input.scan(/((\\\w+)?\{[^\}]*\})*[[:lower:]][^\s#{stops}]*/)
consume_word(:LWORD, input.matched)
when input.scan(/(\\\w+)?\{[^\}]*\}[^\s#{stops}]*/)
consume_word(:PWORD, input.matched)
when input.scan(/('[^'\n]+')|("[^"\n]+")/)
consume_word(:NICK, input.matched[1...-1])
else
raise ArgumentError,
"Failed to parse name #{input.string.inspect}: unmatched data at offset #{input.pos}"
end
end
def on_error(tid, value, stack)
raise ArgumentError,
"Failed to parse name: unexpected '#{value}' at #{stack.inspect}"
end
# -*- racc -*-
|