[CWB] "Segmentation fault (core dumped)" on various versions

Scott Sadowsky ssadowsky at gmail.com
Tue Jul 23 16:01:10 CEST 2013


Hi Andrew,

Sure, here it goes:

===============================
$ cqp -eC -d ALL
Starting parse
Entering state 0
Reading a token: Next token is token SET_SYM ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token SET_SYM ()
Reducing stack by rule 10 (line 383):
-> $$ = nterm $@4 ()
Stack now 0 3
Entering state 10
Next token is token SET_SYM ()
Shifting token SET_SYM ()
Entering state 35
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 111
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 191
Reducing stack by rule 99 (line 689):
   $1 = token ID ()
-> $$ = nterm VarValue ()
Stack now 0 3 10 35 111
Entering state 198
Reducing stack by rule 85 (line 609):
   $1 = token SET_SYM ()
   $2 = token ID ()
   $3 = nterm VarValue ()
-> $$ = nterm OptionSetCmd ()
Stack now 0 3 10
Entering state 60
Reducing stack by rule 28 (line 417):
   $1 = nterm OptionSetCmd ()
-> $$ = nterm InteractiveCommand ()
Stack now 0 3 10
Entering state 53
Reading a token: Next token is token ';' ()
Shifting token ';' ()
Entering state 133
Reducing stack by rule 11 (line 383):
   $1 = nterm $@4 ()
   $2 = nterm InteractiveCommand ()
   $3 = token ';' ()
-> $$ = nterm command ()
Stack now 0 3
Entering state 8
Reducing stack by rule 2 (line 360):
   $1 = nterm $@1 ()
   $2 = nterm command ()
Stack now 0
Starting parse
Entering state 0
Reading a token: Next token is token SET_SYM ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token SET_SYM ()
Reducing stack by rule 10 (line 383):
-> $$ = nterm $@4 ()
Stack now 0 3
Entering state 10
Next token is token SET_SYM ()
Shifting token SET_SYM ()
Entering state 35
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 111
Reading a token: Next token is token INTEGER ()
Shifting token INTEGER ()
Entering state 193
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 280
Reducing stack by rule 104 (line 698):
   $1 = token INTEGER ()
   $2 = token ID ()
-> $$ = nterm VarValue ()
Stack now 0 3 10 35 111
Entering state 198
Reducing stack by rule 85 (line 609):
   $1 = token SET_SYM ()
   $2 = token ID ()
   $3 = nterm VarValue ()
-> $$ = nterm OptionSetCmd ()
Stack now 0 3 10
Entering state 60
Reducing stack by rule 28 (line 417):
   $1 = nterm OptionSetCmd ()
-> $$ = nterm InteractiveCommand ()
Stack now 0 3 10
Entering state 53
Reading a token: Next token is token ';' ()
Shifting token ';' ()
Entering state 133
Reducing stack by rule 11 (line 383):
   $1 = nterm $@4 ()
   $2 = nterm InteractiveCommand ()
   $3 = token ';' ()
-> $$ = nterm command ()
Stack now 0 3
Entering state 8
Reducing stack by rule 2 (line 360):
   $1 = nterm $@1 ()
   $2 = nterm command ()
Stack now 0
Starting parse
Entering state 0
Reading a token: Next token is token SET_SYM ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token SET_SYM ()
Reducing stack by rule 10 (line 383):
-> $$ = nterm $@4 ()
Stack now 0 3
Entering state 10
Next token is token SET_SYM ()
Shifting token SET_SYM ()
Entering state 35
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 111
Reading a token: Next token is token INTEGER ()
Shifting token INTEGER ()
Entering state 193
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 280
Reducing stack by rule 104 (line 698):
   $1 = token INTEGER ()
   $2 = token ID ()
-> $$ = nterm VarValue ()
Stack now 0 3 10 35 111
Entering state 198
Reducing stack by rule 85 (line 609):
   $1 = token SET_SYM ()
   $2 = token ID ()
   $3 = nterm VarValue ()
-> $$ = nterm OptionSetCmd ()
Stack now 0 3 10
Entering state 60
Reducing stack by rule 28 (line 417):
   $1 = nterm OptionSetCmd ()
-> $$ = nterm InteractiveCommand ()
Stack now 0 3 10
Entering state 53
Reading a token: Next token is token ';' ()
Shifting token ';' ()
Entering state 133
Reducing stack by rule 11 (line 383):
   $1 = nterm $@4 ()
   $2 = nterm InteractiveCommand ()
   $3 = token ';' ()
-> $$ = nterm command ()
Stack now 0 3
Entering state 8
Reducing stack by rule 2 (line 360):
   $1 = nterm $@1 ()
   $2 = nterm command ()
Stack now 0
Starting parse
Entering state 0
Reading a token: Next token is token SET_SYM ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token SET_SYM ()
Reducing stack by rule 10 (line 383):
-> $$ = nterm $@4 ()
Stack now 0 3
Entering state 10
Next token is token SET_SYM ()
Shifting token SET_SYM ()
Entering state 35
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 111
Reading a token: Next token is token YES_SYM ()
Shifting token YES_SYM ()
Entering state 195
Reducing stack by rule 101 (line 695):
   $1 = token YES_SYM ()
-> $$ = nterm VarValue ()
Stack now 0 3 10 35 111
Entering state 198
Reducing stack by rule 85 (line 609):
   $1 = token SET_SYM ()
   $2 = token ID ()
   $3 = nterm VarValue ()
-> $$ = nterm OptionSetCmd ()
Stack now 0 3 10
Entering state 60
Reducing stack by rule 28 (line 417):
   $1 = nterm OptionSetCmd ()
-> $$ = nterm InteractiveCommand ()
Stack now 0 3 10
Entering state 53
Reading a token: Next token is token ';' ()
Shifting token ';' ()
Entering state 133
Reducing stack by rule 11 (line 383):
   $1 = nterm $@4 ()
   $2 = nterm InteractiveCommand ()
   $3 = token ';' ()
-> $$ = nterm command ()
Stack now 0 3
Entering state 8
Reducing stack by rule 2 (line 360):
   $1 = nterm $@1 ()
   $2 = nterm command ()
Stack now 0
Starting parse
Entering state 0
Reading a token: Now at end of input.
Reducing stack by rule 4 (line 366):
Cleanup: discarding lookahead token $end ()
Stack now 0
Welcome to CQP -- the  Colourful  Query  Processor .
[30: NBUS  31: NBUS  32: NBUS  33: NBUS  34: NBUS  35: NBUS  36: NBUS  37:
NBUS  ]
[40: NBUS  41: NBUS  42: NBUS  43: NBUS  44: NBUS  45: NBUS  46: NBUS  47:
NBUS  ]
[no corpus]> PERS-DIVER-USENET
Starting parse
Entering state 0
Reading a token: Next token is token ID ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token ID ()
Reducing stack by rule 5 (line 369):
-> $$ = nterm $@2 ()
Stack now 0 3
Entering state 9
Next token is token ID ()
Shifting token ID ()
Entering state 14
Reading a token: Next token is token ';' ()
Reducing stack by rule 240 (line 1253):
   $1 = token ID ()
-> $$ = nterm ID_OR_NQRID ()
Stack now 0 3 9
Entering state 29
Reducing stack by rule 238 (line 1232):
   $1 = nterm ID_OR_NQRID ()
Message:
        CID: PERS-DIVER-USENET
-> $$ = nterm CID ()
Stack now 0 3 9
Entering state 28
Reducing stack by rule 18 (line 405):
   $1 = nterm CID ()
Message:
        CorpusActivate:
-> $$ = nterm CYCommand ()
Stack now 0 3 9
Entering state 23
Next token is token ';' ()
Reducing stack by rule 230 (line 1211):
-> $$ = nterm ReStructure ()
Stack now 0 3 9 23
Entering state 86
Reducing stack by rule 17 (line 402):
   $1 = nterm CYCommand ()
   $2 = nterm ReStructure ()
Message:
        Command: UnnamedCorpusCommand
-> $$ = nterm UnnamedCorpusCommand ()
Stack now 0 3 9
Entering state 22
Reducing stack by rule 15 (line 396):
   $1 = nterm UnnamedCorpusCommand ()
-> $$ = nterm CorpusCommand ()
Stack now 0 3 9
Entering state 21
Next token is token ';' ()
Shifting token ';' ()
Entering state 84
Reducing stack by rule 6 (line 369):
   $1 = nterm $@2 ()
   $2 = nterm CorpusCommand ()
   $3 = token ';' ()
-> $$ = nterm command ()
Stack now 0 3
Entering state 8
Reducing stack by rule 2 (line 360):
   $1 = nterm $@1 ()
   $2 = nterm command ()
Stack now 0
PERS-DIVER-USENET> [word = ".+ai"];
Starting parse
Entering state 0
Reading a token: Next token is token '[' ()
Reducing stack by rule 1 (line 360):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 3
Next token is token '[' ()
Reducing stack by rule 5 (line 369):
-> $$ = nterm $@2 ()
Stack now 0 3
Entering state 9
Next token is token '[' ()
Reducing stack by rule 20 (line 407):
-> $$ = nterm $@6 ()
Stack now 0 3 9
Entering state 24
Next token is token '[' ()
Reducing stack by rule 169 (line 981):
-> $$ = nterm $@11 ()
Stack now 0 3 9 24
Entering state 94
Next token is token '[' ()
Reducing stack by rule 199 (line 1079):
-> $$ = nterm OptTargetSign ()
Stack now 0 3 9 24 94
Entering state 143
Next token is token '[' ()
Reducing stack by rule 201 (line 1083):
-> $$ = nterm OptRefId ()
Stack now 0 3 9 24 94 143
Entering state 228
Next token is token '[' ()
Shifting token '[' ()
Entering state 151
Reading a token: Next token is token ID ()
Shifting token ID ()
Entering state 233
Reading a token: Next token is token '=' ()
Reducing stack by rule 256 (line 1287):
   $1 = token ID ()
-> $$ = nterm RelLHS ()
Stack now 0 3 9 24 94 143 228 151
Entering state 241
Next token is token '=' ()
Shifting token '=' ()
Entering state 328
Reducing stack by rule 268 (line 1336):
   $1 = token '=' ()
-> $$ = nterm RelOp ()
Stack now 0 3 9 24 94 143 228 151 241
Entering state 332
Reading a token: Next token is token STRING ()
Shifting token STRING ()
Entering state 384
Reading a token: Next token is token ']' ()
Reducing stack by rule 211 (line 1152):
-> $$ = nterm OptionalFlag ()
Stack now 0 3 9 24 94 143 228 151 241 332 384
Entering state 430
Reducing stack by rule 261 (line 1294):
   $1 = token STRING ()
   $2 = nterm OptionalFlag ()
CL: Regex compiled successfully using PCRE library
CL: calling pcre_study produced useful information...
CL: cl_regopt_analyse('.+ai')
CL: Regex optimised, 1 grain(s) of length 2
CL: grain set is [ai] (anchored at end of string)
CL: cl_regopt_jumptable for Boyer-Moore search is
CL: | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2 | 2      | 2
 | 2
      | 2
 | 2       | 2
CL: | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2 ▒ | 2  | 2 ▒ | 2 | 2  | 2
 | 2
CL: | 2   | 2 ! | 2 " | 2 # | 2 $ | 2 % | 2 & | 2 ' | 2 ( | 2 ) | 2 * | 2 +
| 2 , | 2 - | 2 .
CL: | 2 0 | 2 1 | 2 2 | 2 3 | 2 4 | 2 5 | 2 6 | 2 7 | 2 8 | 2 9 | 2 : | 2 ;
| 2 < | 2 = | 2 >
CL: | 2 @ | 2 A | 2 B | 2 C | 2 D | 2 E | 2 F | 2 G | 2 H | 2 I | 2 J | 2 K
| 2 L | 2 M | 2 N
CL: | 2 P | 2 Q | 2 R | 2 S | 2 T | 2 U | 2 V | 2 W | 2 X | 2 Y | 2 Z | 2 [
| 2 \ | 2 ] | 2 ^
CL: | 2 ` | 1 a | 2 b | 2 c | 2 d | 2 e | 2 f | 2 g | 2 h | 0 i | 2 j | 2 k
| 2 l | 2 m | 2 n
CL: | 2 p | 2 q | 2 r | 2 s | 2 t | 2 u | 2 v | 2 w | 2 x | 2 y | 2 z | 2 {
| 2 | | 2 } | 2 ~
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: using 1 grain(s) for optimised regex matching
-> $$ = nterm RelRHS ()
Stack now 0 3 9 24 94 143 228 151 241 332
Entering state 398
Reducing stack by rule 247 (line 1264):
   $1 = nterm RelLHS ()
   $2 = nterm RelOp ()
   $3 = nterm RelRHS ()
-> $$ = nterm RelExpr ()
Stack now 0 3 9 24 94 143 228 151
Entering state 240
Reducing stack by rule 246 (line 1261):
   $1 = nterm RelExpr ()
-> $$ = nterm BoolExpr ()
Stack now 0 3 9 24 94 143 228 151
Entering state 246
Next token is token ']' ()
Shifting token ']' ()
Entering state 335
Reducing stack by rule 206 (line 1103):
   $1 = token '[' ()
   $2 = nterm BoolExpr ()
   $3 = token ']' ()
-> $$ = nterm ExtConstraint ()
Stack now 0 3 9 24 94 143 228
Entering state 153
Reducing stack by rule 202 (line 1086):
   $1 = nterm ExtConstraint ()
-> $$ = nterm WordformPattern ()
Stack now 0 3 9 24 94 143 228
Entering state 314
Reducing stack by rule 197 (line 1072):
   $1 = nterm OptTargetSign ()
   $2 = nterm OptRefId ()
   $3 = nterm WordformPattern ()
Message:
        NamedWfPattern
-> $$ = nterm NamedWfPattern ()
Stack now 0 3 9 24 94
Entering state 171
Reducing stack by rule 183 (line 1025):
   $1 = nterm NamedWfPattern ()
-> $$ = nterm RegWordfPower ()
Stack now 0 3 9 24 94
Entering state 168
Reading a token: Next token is token ';' ()
Reducing stack by rule 181 (line 1021):
   $1 = nterm RegWordfPower ()
-> $$ = nterm RegWordfFactor ()
Stack now 0 3 9 24 94
Entering state 167
Reducing stack by rule 176 (line 995):
   $1 = nterm RegWordfFactor ()
-> $$ = nterm RegWordfTerm ()
Stack now 0 3 9 24 94
Entering state 166
Next token is token ';' ()
Reducing stack by rule 174 (line 990):
   $1 = nterm RegWordfTerm ()
-> $$ = nterm RegWordfExpr ()
Stack now 0 3 9 24 94
Entering state 165
Next token is token ';' ()
Reducing stack by rule 170 (line 982):
-> $$ = nterm $@12 ()
Stack now 0 3 9 24 94 165
Entering state 262
Next token is token ';' ()
Reducing stack by rule 213 (line 1156):
-> $$ = nterm GlobalConstraint ()
Stack now 0 3 9 24 94 165 262
Entering state 346
Reducing stack by rule 171 (line 984):
-> $$ = nterm $@13 ()
Stack now 0 3 9 24 94 165 262 346
Entering state 404
Next token is token ';' ()
Reducing stack by rule 220 (line 1181):
-> $$ = nterm SearchSpace ()
Stack now 0 3 9 24 94 165 262 346 404
Entering state 442
Reducing stack by rule 172 (line 981):
   $1 = nterm $@11 ()
   $2 = nterm RegWordfExpr ()
   $3 = nterm $@12 ()
   $4 = nterm GlobalConstraint ()
   $5 = nterm $@13 ()
   $6 = nterm SearchSpace ()
Message:
        SearchPattern
Evaltree:


  word
=

  REGEX .+ai
Search String: `` "0" ''
s0 = 0 s1
s1 = fin
-> $$ = nterm SearchPattern ()
Stack now 0 3 9 24
Entering state 93
Reducing stack by rule 216 (line 1166):
-> $$ = nterm AlignmentConstraints ()
Stack now 0 3 9 24 93
Entering state 159
Next token is token ';' ()
Reducing stack by rule 222 (line 1190):
-> $$ = nterm CutStatement ()
Stack now 0 3 9 24 93 159
Entering state 252
Next token is token ';' ()
Reducing stack by rule 168 (line 978):
-> $$ = nterm OptKeep ()
Stack now 0 3 9 24 93 159 252
Entering state 339
Reducing stack by rule 165 (line 968):
   $1 = nterm SearchPattern ()
   $2 = nterm AlignmentConstraints ()
   $3 = nterm CutStatement ()
   $4 = nterm OptKeep ()
Message:
        Query

 ================= ENVIRONMENT #0 ===============

Has no target indicator.

==================== DFA:

s0              0 -> s1,
s1(final)       0 -> E

==================== Evaluation Tree:



  word
=

  REGEX .+ai

==================== Global Constraints:


==================== Pattern List:

Size: 1
Pattern #0:

  word
=

  REGEX .+ai

==================== End of Pattern List

 ================= END ENVIRONMENT #0 =============
calc_initial_ml: evaluate comparisons
CL: Regex compiled successfully using PCRE library
CL: calling pcre_study produced useful information...
CL: cl_regopt_analyse('.+ai')
CL: Regex optimised, 1 grain(s) of length 2
CL: grain set is [ai] (anchored at end of string)
CL: cl_regopt_jumptable for Boyer-Moore search is
CL: | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2 | 2      | 2
 | 2
      | 2
 | 2       | 2
CL: | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2  | 2 ▒ | 2  | 2 ▒ | 2 | 2  | 2
 | 2
CL: | 2   | 2 ! | 2 " | 2 # | 2 $ | 2 % | 2 & | 2 ' | 2 ( | 2 ) | 2 * | 2 +
| 2 , | 2 - | 2 .
CL: | 2 0 | 2 1 | 2 2 | 2 3 | 2 4 | 2 5 | 2 6 | 2 7 | 2 8 | 2 9 | 2 : | 2 ;
| 2 < | 2 = | 2 >
CL: | 2 @ | 2 A | 2 B | 2 C | 2 D | 2 E | 2 F | 2 G | 2 H | 2 I | 2 J | 2 K
| 2 L | 2 M | 2 N
CL: | 2 P | 2 Q | 2 R | 2 S | 2 T | 2 U | 2 V | 2 W | 2 X | 2 Y | 2 Z | 2 [
| 2 \ | 2 ] | 2 ^
CL: | 2 ` | 1 a | 2 b | 2 c | 2 d | 2 e | 2 f | 2 g | 2 h | 0 i | 2 j | 2 k
| 2 l | 2 m | 2 n
CL: | 2 p | 2 q | 2 r | 2 s | 2 t | 2 u | 2 v | 2 w | 2 x | 2 y | 2 z | 2 {
| 2 | | 2 } | 2 ~
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 � | 2 �
| 2 � | 2 � | 2 �
CL: using 1 grain(s) for optimised regex matching
CL: regexp optimiser avoided calling regex engine for 582913 candidates out
of 583648 strings
    (734 matching strings in total)
Segmentation fault (core dumped)
$


===============================

On Tue, Jul 23, 2013 at 5:16 AM, Hardie, Andrew <a.hardie at lancaster.ac.uk>wrote:

>  Hi Scott,****
>
> ** **
>
> This looks serious. Could you try this again, but this time, use the *-d
> ALL* option when you start up CQP;  and let us know what messages you get?
> ****
>
> ** **
>
> Thanks,****
>
> ** **
>
> best****
>
> ** **
>
> Andrew.****
>
> ** **
>
> *From:* cwb-bounces at sslmit.unibo.it [mailto:cwb-bounces at sslmit.unibo.it] *On
> Behalf Of *Scott Sadowsky
> *Sent:* 23 July 2013 05:13
> *To:* CWB at sslmit.unibo.it
> *Subject:* [CWB] "Segmentation fault (core dumped)" on various versions***
> *
>
> ** **
>
> Hi all,****
>
> ** **
>
> I'm getting the following error whenever I use most regular expressions **
> **
>
> ** **
>
> [no corpus]> PERS-DIVER-USENET ****
>
> PERS-DIVER-USENET> [word = ".+ai"]****
>
> Segmentation fault (core dumped) ****
>
> ** **
>
> [no corpus]> PERS-DIVER-USENET ****
>
> PERS-DIVER-USENET> [word = ".*ai"];****
>
> Segmentation fault (core dumped) ****
>
> ** **
>
> [no corpus]> PERS-DIVER-USENET ****
>
> PERS-DIVER-USENET> [word = ".ai"];****
>
> Segmentation fault (core dumped) ****
>
> ** **
>
> However, for what it's worth, this does NOT happen in cases such as the
> following:****
>
> ** **
>
> [no corpus]> PERS-DIVER-USENET ****
>
> PERS-DIVER-USENET> [word = "cas(a|o)(s|)"];****
>
> ** **
>
> This happens on both version 3.0 (from the website) and version 3.4.7 from
> SVN.****
>
> ** **
>
> This bug <http://sourceforge.net/p/cwb/bugs/52/> seems to refer to the
> problem I'm having, but it's marked as "fixed", so I'm not sure where to go
> from here. Any help would be appreciated.****
>
> ** **
>
> Thanks,****
>
> Scott****
>



-- 
Scott Sadowsky, Ph.D.
Profesor de Lingüística
Departamento de Lenguas, Literatura y Comunicación
Universidad de La Frontera, Temuco, Chile

http://sadowsky.cl/

ssadowsky gmail com
scott.sadowsky ufrontera cl
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://devel.sslmit.unibo.it/pipermail/cwb/attachments/20130723/731e9bd1/attachment-0001.html>


More information about the CWB mailing list