{"id":"W2071685823","doi":"10.1007/s002360000037","title":"Efficiently building a parse tree from a regular expression","year":2000,"lang":"en","type":"article","venue":"Acta Informatica","topic":"semigroups and automata theory","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Parse tree; Parsing; Computer science; String (physics); Theory of computation; Tree (set theory); Regular expression; Representation (politics); Time complexity; Parsing expression grammar; Rule-based machine translation; Context (archaeology); Theoretical computer science; S-attributed grammar; Algorithm; Artificial intelligence; Context-free grammar; L-attributed grammar; Mathematics; Programming language; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835605,0.001130497,0.00167408,0.001485029,0.001069747,0.002212041,0.001508021,0.001514107,0.009242496],"category_scores_gemma":[0.006677561,0.001199129,0.002228941,0.001880154,0.001018412,0.004365948,0.002449265,0.00256542,0.005680338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007081183,"about_ca_system_score_gemma":0.002172488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789438,"about_ca_topic_score_gemma":0.003449479,"domain_scores_codex":[0.9987705,0.0002863921,0.00009655934,0.0002765571,0.0004438782,0.0001260753],"domain_scores_gemma":[0.9951504,0.003622693,0.0001096824,0.0004627479,0.000576194,0.00007826204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006726094,0.0003864703,0.002416902,0.002081222,0.0002188864,0.002095241,0.001672525,0.03825595,0.04938561,0.1205101,0.09405928,0.6882452],"study_design_scores_gemma":[0.0002501465,0.0002273564,0.001027913,0.000262934,0.000338372,0.001157008,0.0008379933,0.5001781,0.06122985,0.3609203,0.0734181,0.0001519923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03654708,0.0004589978,0.9146314,0.001170399,0.0002521972,0.0003196261,0.003360836,0.03582777,0.007431667],"genre_scores_gemma":[0.1596499,0.0004937692,0.8175924,0.0003924021,0.0001179027,0.0002749118,0.008401017,0.006201248,0.006876411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009242496,"threshold_uncertainty_score":0.03091925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005874499761680074,"score_gpt":0.2030990138928541,"score_spread":0.197224514131174,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}