Subversion Repositories wimsdev

Rev

Rev 8155 | Rev 8500 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | RSS feed

  1. /*    Copyright (C) 1998-2003 XIAO, Gang of Universite de Nice - Sophia Antipolis
  2.  *
  3.  *  This program is free software; you can redistribute it and/or modify
  4.  *  it under the terms of the GNU General Public License as published by
  5.  *  the Free Software Foundation; either version 2 of the License, or
  6.  *  (at your option) any later version.
  7.  *
  8.  *  This program is distributed in the hope that it will be useful,
  9.  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  10.  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  11.  *  GNU General Public License for more details.
  12.  *
  13.  *  You should have received a copy of the GNU General Public License
  14.  *  along with this program; if not, write to the Free Software
  15.  *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16.  */
  17. #include "wims.h"
  18.  
  19. /* internal variable */
  20. int rawmath_easy=0;
  21.  
  22. struct hmname hmname[]={
  23.       {"CC",            "", ""},
  24.       {"Delta",         "", ""},
  25.       {"Gamma",         "", ""},
  26.       {"Inf",           "$(m_infty)","\\infty"},
  27.       {"Lambda",        "", ""},
  28.       {"NN",            "", ""},
  29.       {"Omega",         "", ""},
  30.       {"Phi",           "", ""},
  31.       {"Pi",            "", ""},
  32.       {"Psi",           "", ""},
  33.       {"QQ",            "",""},
  34.       {"RR",            "",""},
  35.       {"Sigma",         "",""},
  36.       {"Xi",            "",""},
  37.       {"ZZ",            "",""},
  38.       {"alpha",         "", ""},
  39.       {"beta",          "", ""},
  40.       {"cap",           "",""},
  41.       {"chi",           "",""},
  42.       {"cup",           "",""},
  43.       {"delta",         "",""},
  44.       {"div",           "÷", "÷"},
  45.       {"divide",        "÷","÷"},
  46.       {"epsilon",       "$(m_varepsilon)","\\varepsilon"},
  47.       {"eta",           "",""},
  48.       {"exist",         "$(m_exists)","\\exists"},
  49.       {"exists",        "", ""},
  50.       {"forall",        "",""},
  51.       {"gamma",         "",""},
  52.       {"in",            "",""},
  53.       {"inf",           "$(m_infty)","\\infty"},
  54.       {"infinity",      "$(m_infty)","\\infty"},
  55.       {"infty",         "",""},
  56.       {"intersect",     "$(m_cap)", "\\cap"},
  57.       {"intersection",  "$(m_cap)", "\\cap"},
  58.       {"iota",          "",""},
  59.       {"kappa",         "",""},
  60.       {"lambda",        "", ""},
  61.       {"mu",            "",""},
  62.       {"nabla",         "",""},
  63.       {"neq",           "",""},
  64.       {"nu",            "",""},
  65.       {"omega",         "",""},
  66.       {"pi",            "",""},
  67.       {"pm",            "",""},
  68.       {"psi",           "",""},
  69.       {"rho",           "",""},
  70.       {"sigma",         "",""},
  71.       {"subset",        "", ""},
  72.       {"subseteq",      "",""},
  73.       {"tau",           "",""},
  74.       {"theta",         "",""},
  75.       {"times",         "×", "\\times"},
  76.       {"union",         "$(m_cup)", "\\cup"},
  77.       {"varepsilon",    "",""},
  78.       {"varphi",        "", ""},
  79.       {"x",             "","x"},
  80.       {"xi",    "",""},
  81.       {"y",             "","y"},
  82.       {"z",             "","z"},
  83.       {"zeta",  "",""},
  84. };
  85. int hmname_no=(sizeof(hmname)/sizeof(hmname[0]));
  86.  
  87. enum {RM_UNKNOWN, RM_FN, RM_VAR, RM_PREFIX};
  88.  
  89. struct mathname mathname[]={
  90.       {"Arc",     RM_PREFIX, "arc"},
  91.       {"Arg",     RM_PREFIX, "arg"},
  92.       {"Ci",      RM_FN,        ""},
  93.       {"E",       RM_VAR,       ""},
  94.       {"Euler",   RM_VAR,       ""},
  95.       {"I",       RM_VAR,       ""},
  96.       {"Int",     RM_FN,        ""},
  97.       {"PI",      RM_VAR,       ""},
  98.       {"Pi",      RM_VAR,       ""},
  99.       {"Prod",    RM_FN,        ""},
  100.       {"Si",      RM_FN,        ""},
  101.       {"Sum",     RM_FN,        ""},
  102.       {"arc",     RM_PREFIX,    ""},
  103.       {"arg",     RM_PREFIX,    ""},
  104.       {"binomial",RM_FN,        ""},
  105.       {"diff",    RM_FN,        ""},
  106.       {"e",       RM_VAR,       ""},
  107.       {"erf",     RM_FN,        ""},
  108.       {"euler",   RM_VAR,       ""},
  109.       {"i",       RM_VAR,       ""},
  110.       {"infinity",RM_VAR,       ""},
  111.       {"int",     RM_FN,        ""},
  112.       {"integrate",RM_FN,       ""},
  113.       {"neq",     RM_VAR,       ""},
  114.       {"pi",      RM_VAR,       ""},
  115.       {"prod",    RM_FN,        ""},
  116.       {"product", RM_FN,        ""},
  117.       {"psi",     RM_FN,        ""},
  118.       {"sum",     RM_FN,        ""},
  119.       {"theta",   RM_FN,        ""},
  120.       {"x",       RM_VAR,       ""},
  121.       {"y",       RM_VAR,       ""},
  122.       {"z",       RM_VAR,       ""},
  123.       {"zeta",    RM_FN,        ""},
  124. };
  125. int mathname_no=(sizeof(mathname)/sizeof(mathname[0]));
  126. char rm_vbuf[MAX_LINELEN+1],rm_fbuf[MAX_LINELEN+1];
  127. char *rm_uservar[MAX_LINELEN+1],*rm_userfn[MAX_LINELEN+1];
  128. int  rm_uservars,rm_userfns;
  129.  
  130. /* add user-defined variables and function names,
  131.  * internal, only called by rawmath().
  132.  */
  133. void getuservar(void)
  134. {
  135.     char *p1, *p2, *p;
  136.     rm_uservars=rm_userfns=0;
  137.     p=getvar("wims_rawmath_variables");
  138.     if(p!=NULL && *p!=0) {
  139.        ovlstrcpy(rm_vbuf,p);
  140.        for(p=rm_vbuf;*p;p++) if(*p==',') *p=' ';
  141.        for(p1=find_word_start(rm_vbuf);*p1;p1=find_word_start(p2)) {
  142.           rm_uservar[rm_uservars++]=p1;
  143.           p2=find_word_end(p1);
  144.           if(*p2!=0) *(p2++)=0;
  145.        }
  146.     }
  147.     p=getvar("wims_rawmath_functions");
  148.     if(p!=NULL && *p!=0) {
  149.       ovlstrcpy(rm_fbuf,p);
  150.       for(p=rm_fbuf;*p;p++) if(*p==',') *p=' ';
  151.       for(p1=find_word_start(rm_fbuf);*p1;p1=find_word_start(p2)) {
  152.         rm_userfn[rm_userfns++]=p1;
  153.         p2=find_word_end(p1);
  154.         if(*p2!=0) *(p2++)=0;
  155.       }
  156.     }
  157. }
  158.  
  159. /* Try to split a word into recognizable variables */
  160. char *mathname_split(char *p)
  161. {
  162.     int c,i,j,type;
  163.  
  164.     c=0;
  165.     beg: for(i=get_evalcnt()-1;
  166.     i>=0 && strncmp(p,get_evalname(i),strlen(get_evalname(i)))!=0;
  167.     i--);
  168.     if(i>=0 && get_evaltype(i)>0) {
  169.       type=RM_FN;
  170.       j=strlen(get_evalname(i));
  171.       gotit:
  172.       if(!*(p+j)) return p;
  173.       if(myisdigit(*(p+j)) && type!=RM_FN) return NULL;
  174.       if(!c) {string_modify(p,p+j,p+j," "); p+=j+1;}
  175.       else p+=j;
  176.       c++; goto beg;
  177.     }
  178.     for(i=mathname_no-1;
  179.       i>=0 &&
  180.       (strncmp(p,mathname[i].name,strlen(mathname[i].name))!=0
  181.       || mathname[i].style==RM_PREFIX);
  182.       i--);
  183.     if(i>=0) {
  184.       type=mathname[i].style;
  185.       j=strlen(mathname[i].name);
  186.       goto gotit;
  187.     }
  188.     for(i=0;i<rm_uservars &&
  189.       strncmp(rm_uservar[i],p,strlen(rm_uservar[i]));i++);
  190.     if(i<rm_uservars) {
  191.       type=RM_VAR;
  192.       j=strlen(rm_uservar[i]); goto gotit;
  193.     }
  194.     for(i=0;i<rm_userfns &&
  195.       strncmp(p,rm_userfn[i],strlen(rm_userfn[i]));i++);
  196.     if(i<rm_userfns) {
  197.       type=RM_FN;
  198.       j=strlen(rm_userfn[i]); goto gotit;
  199.     }
  200.     return NULL;
  201. }
  202.  
  203. int __replace_badchar (char *p, char *old, char *new)
  204. { int cnt = 0;
  205.   char *p1 ;
  206.   while((p1=strstr(p,old))!=NULL) {
  207.     string_modify(p,p1,p1+strlen(old),"%s",new);
  208.     cnt++;
  209.   }
  210.   return cnt ;
  211. }
  212.  
  213. /* translate |x| into abs(x)*/
  214. int __replace_abs ( char *p )
  215. {
  216.     char *p1, *p2 ;
  217.     while((p1=strchr(p,'|'))!=NULL) {
  218.       p2=find_matching(p1+1,'|');
  219.       if(p2==NULL) { return 1; break;} /* error; drop it. */
  220.       *p2=')'; string_modify(p,p1,p1+1,"abs(");
  221.     }
  222.     return 0;
  223. }
  224.  
  225. /* signs: translate ++, +-, -+, ... into one sign. */
  226. void __replace_plusminus ( char *p )
  227. {
  228.    char *p1, *p2;
  229.    for(p1=p;*p1!=0;p1++) {
  230.      int sign, redundant;
  231.      if(*p1!='+' && *p1!='-') continue;
  232.      if(*p1=='+') sign=1; else sign=-1;
  233.      redundant=0;
  234.      for(p2=find_word_start(p1+1);*p2=='+' || *p2=='-';
  235.         p2=find_word_start(p2+1)) {
  236.          if(*p2=='-') sign*=-1;
  237.          redundant=1;
  238.      }
  239.      if(redundant && *p2!='>' && strncmp(p2,"&gt;",4)!=0) {
  240.         if(sign==1) *p1='+'; else *p1='-';
  241.         ovlstrcpy(p1+1,p2);
  242.      }
  243.    }
  244. }
  245.  
  246. /* dangling decimal points
  247.  * 4. --> 4.0  4.x -> 4.0x
  248.  * .5 -> 0.5
  249.  * another treatment is done in insmath (will replace .. by , )
  250.  */
  251. void __treat_decimal(char *p)
  252. { char *p1 ;
  253.   for(p1=strchr(p,'.'); p1!=NULL; p1=strchr(p1+1,'.')) {
  254.         /* multiple .. is conserved */
  255.     if(*(p1+1)=='.') {
  256.         do p1++; while(*p1=='.'); continue;
  257.     }
  258.     if(p1>p && myisdigit(*(p1-1)) && myisdigit(*(p1+1))) continue;
  259.         /* Non-digit dangling '.' is removed */
  260.     if((p1<=p || !myisdigit(*(p1-1))) && !myisdigit(*(p1+1))) {
  261.         ovlstrcpy(p1,p1+1); p1--; continue;
  262.     }
  263.     if(p1==p || !myisdigit(*(p1-1))) { // nondigit.digit
  264.         string_modify(p,p1,p1,"0"); p1++; //add zero before point
  265.     }
  266.     if(!myisdigit(*(p1+1))) string_modify(p,p1+1,p1+1,"0"); //add zero after point
  267.   }
  268. }
  269.  
  270. /* replace new-lines, tabs, " */
  271. void __replace_space(char *p)
  272. {
  273.  char *p1 ;
  274.  for(p1=p;*p1!=0; p1++) {
  275.     if(*p1=='\\' || isspace(*p1)) *p1=' ';// replace \ and all spaces by a simple space -
  276.     if(*p1=='\"') string_modify(p,p1,p1+1,"''"); p1++; // replace " by ''
  277.   }
  278. }
  279.  
  280. /* Error-tolerante raw math translation routine
  281.  * Translate error-laden raw math into machine-understandable form.
  282.  * do nothing if there is some { or \\
  283.  */
  284. void rawmath(char *p)
  285. {
  286.     char *p1, *p2, *p3, *p4;
  287.     char warnbuf[1024];
  288.     int ambiguous=0,unknown=0,flatpower=0,badprec=0,unmatch=0;// for warning
  289.  
  290. /* looks like a TeX source : do nothing */
  291.     if( (strchr(p,'\\')!=NULL || strchr(p,'{')!=NULL)) return;
  292.     if(strchr(p,'^')==NULL) flatpower=-1;
  293.     if(strlen(p)>=MAX_LINELEN) {*p=0; return;}
  294.     p1=find_word_start(p);if(*p1==0) return;
  295.     while(*p1=='+') p1++;
  296.     if(p1>p) ovlstrcpy(p,p1);
  297.     (void)__replace_badchar(p,"**", "^");
  298.     if (__replace_badchar(p,"²", "^2 ")) flatpower=1;
  299.     if (__replace_badchar(p,"³", "^3 ")) flatpower=1;
  300.     unmatch=__replace_abs(p);
  301.     __replace_plusminus(p) ;
  302.     __replace_space(p);
  303.     __treat_decimal(p);
  304.     if (rawmath_easy) return;
  305.  
  306. /* Principal translation: justapositions to multiplications */
  307.     if(strstr(p,"^1/")!=NULL) badprec=1;
  308.     getuservar();
  309.     for(p1=p;*p1;p1++) {
  310.       if(!isalnum(*p1) && *p1!=')' && *p1!=']') continue;
  311.       if(*p1==')' || *p1==']') {
  312.         p2=find_word_start(++p1);
  313.         add_star:
  314.         if(isalnum(*p2) || *p2=='(' || *p2=='[') {
  315.         if(*p2=='(' && *p1==')') ambiguous=1;
  316.         if(p2>p1) *p1='*';
  317.         else string_modify(p,p1,p1,"*");
  318.         }
  319.         p1--;continue;
  320.     }
  321.     p2=find_mathvar_end(p1); p3=find_word_start(p2);
  322.     if(myisdigit(*p1)) {
  323.         p1=p2; p2=p3; goto add_star;
  324.     }
  325.     else {
  326.         char buf[MAX_LINELEN+1];
  327.         int i;
  328.         if(p2-p2>30) goto ambig;
  329.         memcpy(buf,p1,p2-p1);buf[p2-p1]=0;
  330.         i=search_evaltab(buf);
  331.         if(i>=0 && get_evaltype(i)>0) {
  332.           fnname1:
  333.           p1=p2;p2=p3;
  334. /*fnname:*/
  335.           if(*p2 && *p2!='(' && *p2!='*' && *p2!='/') {
  336.             char hatbuf[MAX_LINELEN+1];
  337.             hatbuf[0]=')'; hatbuf[1]=0;
  338.             if(*p2=='^') {
  339.               p3=p2+1;while(*p3==' ' || *p3=='+' || *p3=='-') p3++;
  340.               if(*p3=='(') {
  341.                 p3=find_matching(p3+1,')');
  342.                 if(p3==NULL) {unmatch=1; p3=p+strlen(p);}
  343.                 else p3++;
  344.               }
  345.               else p3=find_mathvar_end(p3);
  346.               memmove(hatbuf+1,p2,p3-p2);hatbuf[p3-p2+1]=0;
  347.               ovlstrcpy(p2,p3);
  348.               while(*p2==' ') p2++;
  349.               if(*p2=='*' || *p2=='/') {
  350.                 p1--;continue;
  351.               }
  352.               if(*p2=='(') {
  353.                 p3=find_matching(p2+1,')');
  354.                 if(p3==NULL) {unmatch=1; p3=p+strlen(p);}
  355.                 else p3++;
  356.                 string_modify(p,p3,p3,"%s",hatbuf+1);
  357.                 goto dd2;
  358.               }
  359.             }
  360.             p3=p2;if(*p3=='+' || *p3=='-') p3++;
  361.             while(isalnum(*p3) || *p3=='*' || *p3=='/' || *p3=='.')
  362.               p3++;
  363.             for(p4=p2; p4<p3 && !isalnum(*p4); p4++);
  364.             if(p4>=p3) {
  365.               if(hatbuf[1]) string_modify(p,p2,p2,"%s",hatbuf+1);
  366.             }
  367.             else {
  368.               string_modify(p,p3,p3,"%s",hatbuf);
  369.               if(p1==p2) string_modify(p,p2,p2,"(");
  370.               else *p1='(';
  371.             }
  372.             dd2:
  373.             ambiguous=1;
  374.           }
  375.           p1--;continue;
  376.         }
  377.         i=search_list(mathname,mathname_no,sizeof(mathname[0]),buf);
  378.         if(i>=0) {
  379.           if(mathname[i].replace[0]!=0) {
  380.             string_modify(p,p1,p2,mathname[i].replace);
  381.             p2=p1+strlen(mathname[i].replace);
  382.             p3=find_word_start(p2);
  383.           }
  384.           switch(mathname[i].style) {
  385.             case RM_FN:
  386.               goto fnname1;
  387.  
  388.             case RM_VAR:
  389.               p1=p2;p2=p3; goto add_star;
  390.  
  391.             case RM_PREFIX:
  392.               if(*p3!='c' && *p3!='s' && *p3!='t' &&
  393.              *p3!='C' && *p3!='S' && *p3!='T') break;
  394.               ambiguous=1;
  395.               ovlstrcpy(p2,p3); p1--; continue;
  396.           }
  397.         }
  398.         i=search_list(hmname,hmname_no,sizeof(hmname[0]),buf);
  399.         if(i>=0) {
  400.           p1=p2; p2=p3; goto add_star;
  401.         }
  402.         for(i=0;i<rm_uservars && strcmp(buf,rm_uservar[i]);i++);
  403.         if(i<rm_uservars) {
  404.           p1=p2;p2=p3;goto add_star;
  405.         }
  406.         for(i=0;i<rm_userfns && strcmp(buf,rm_userfn[i]);i++);
  407.         if(i<rm_userfns) goto fnname1;
  408.         if(p2-p1>8) goto ambig;
  409.         if(mathname_split(buf)!=NULL) {
  410.           ambiguous=1;
  411.           string_modify(p,p1,p2,"%s",buf);
  412.           p1--; continue;
  413.         }
  414. /* unknown name */
  415.         ambig: p1=p2;p2=p3;
  416.         if(strlen(buf)>1) {
  417.           for(p3=buf;*p3!=0 && !myisdigit(*p3);p3++);
  418.           if(*p3!=0 && flatpower!=0) flatpower=1;
  419.           else {
  420.             unknown=1;
  421.             force_setvar("wims_warn_rawmath_parm",buf);
  422.           }
  423.         }
  424.         else {
  425.           if(*p2=='(') ambiguous=1;
  426.         }
  427.         if(isalnum(*p2)) {
  428.           if(p2>p1) *p1='*';
  429.           else string_modify(p,p1,p1,"*");
  430.         }
  431.         p1--;continue;
  432.       }
  433.     }
  434.     warnbuf[0]=0;
  435.     if(ambiguous) strcat(warnbuf," ambiguous");
  436.     if(unknown) strcat(warnbuf," unknown");
  437.     if(flatpower>0) strcat(warnbuf," flatpower");
  438.     if(badprec>0) strcat(warnbuf," badprec");
  439.     if(unmatch>0) strcat(warnbuf," unmatched_parentheses");
  440.     if(warnbuf[0]) {
  441.     char buf[MAX_LINELEN+1],*p;
  442.     p=getvar("wims_warn_rawmath");
  443.     if(p!=NULL && *p!=0) {
  444.         snprintf(buf,sizeof(buf),"%s %s",p,warnbuf);
  445.         force_setvar("wims_warn_rawmath",buf);
  446.     }
  447.     else force_setvar("wims_warn_rawmath",warnbuf);
  448.     }
  449. }
  450.  
  451.  /* replace < and > by html code if htmlmath_gtlt=yes
  452.   * is only used in deduc - not documented
  453.   */
  454. void __replace_htmlmath_gtlt (char *p)
  455. {   char *pp;
  456.     char *p1=getvar("htmlmath_gtlt");
  457.     if(p1!=NULL && strcmp(p1,"yes")==0) {
  458.       for(pp=strchr(p,'<'); pp!=NULL; pp=strchr(pp+1,'<'))
  459.       string_modify(p,pp,pp+1,"&lt;");
  460.       for(pp=strchr(p,'>'); pp!=NULL; pp=strchr(pp+1,'>'))
  461.       string_modify(p,pp,pp+1,"&gt;");
  462.    }
  463. }
  464.  
  465. /* exponents or indices :
  466.  *  all digits or + or - following a ^ or _ are considered as in exponent/subscript
  467.  *  expression with ( ) following a ^ or _ are  considered as in exponent/subscript
  468.  *  the parenthesis are suppressed except in case of exponent and only digits.
  469.  *  if int n != 0, use html code, else use tex code
  470.  */
  471. void __replace_exponent(char *p, int n)
  472. {
  473.    char *p1;
  474.    char *SUPBEG, *SUPEND;
  475.    if (n) { SUPBEG = "<sup>"; SUPEND = "</sup>";}
  476.    else { SUPBEG = "^{"; SUPEND = "}";}
  477.  
  478.     for(p1=strchr(p,'^');p1!=NULL;p1=strchr(p1+1,'^')) {
  479.         char *p2, *p3, *pp;
  480.         char c;
  481.         p3 = p2 = find_word_start(p1+1);
  482.         if(*p2=='+' || *p2=='-') p2++;
  483.         p2 = find_word_start(p2);
  484. /* jm.evers 31.1.2014
  485.  * add '}' to recognized parenthesis in exponent
  486.  * !mathmlmath 2 \cdot x^{3} will now produce correct exponent...
  487.  * !mathmlmath should convert LaTeX input into correct MathML
  488.  */
  489.         if(*p2=='(' || *p2 == '{') { /* ^[+-]( */
  490.              if(*p2 == '('){ p2 = find_matching(p2+1,')');}else { if(*p2 == '{'){ p2 = find_matching(p2+1,'}');}}
  491.             /* no matching ')' : p2 = end of line; otherwise just after ')' */
  492.             if (p2==NULL) p2=p+strlen(p); else p2++;
  493.             /* ^( followed by any number of digits/letters, up to p2
  494.              * [FIXME: no sign?] */
  495.             /* do we remove parentheses containing exponent group ? */
  496.             if (*p3=='(') for(pp=p3+1;pp<p2-1;pp++) {
  497.                 if(!isalnum(*pp)) {
  498.                     /* not a digit/letter. Remove (). */
  499.                     p3++;*(p2-1)=0;break;
  500.                 }
  501.                 /* x^(2), parentheses not removed */
  502.             }
  503. /* p3: start of word after ^
  504.  * matching parentheses from exponent group. : f^(4) 4-derivative
  505.  * don't  ignore / remove a leading + sign in exponent group : Cu^+
  506.  */
  507.         } else { /* ^[+-] */
  508.             char *ptt=p2;
  509.             p2=find_word_start(find_mathvar_end(p2));
  510.             if(*p2=='(' && isalpha(*ptt)) {
  511.                 /* ^[+-]var( */
  512.                 char *p2t;
  513.                 p2t=find_matching(p2+1,')'); if(p2t!=NULL) p2=p2t+1;
  514.                 /* FIXME: what if no matching ) ? */
  515.             }
  516. /* ^[+-]var(...): p2 points after closing ')'
  517.  * FIXME: I don't think this 'else' branch is sensible. One
  518.  * should NOT accept x^b(c+1) as meaning x^[b(c+1)]. I would
  519.  * remove it altogether.
  520.  */
  521.         }
  522. /* p1 points at ^ before exponent group
  523.  * p2 points at end of exponent group
  524.  * p3 = exponent group (sometimes stripped, without parentheses)
  525.  *
  526.  * truncate string p at p2 [ c = char deleted by truncation ]
  527.  */
  528.         c = *p2;if(c!=0) *p2++=0;
  529.         /* replace ^<exponent group>. Add back missing character 'c' */
  530.         string_modify(p,p1,p2, "%s%s%s%c",SUPBEG,p3,SUPEND,c);
  531.     }
  532. }
  533.  
  534. /* if int n != 0, use html code, else use tex code */
  535. void __replace_subscript(char *p, int n)
  536. {
  537.    char *p1, *p2;
  538.    char *SUBBEG, *SUBEND;
  539.    if (n) {SUBBEG = "<sub>"; SUBEND = "</sub>";}
  540.    else {SUBBEG = "_{"; SUBEND = "}";}
  541.    for(p1=strchr(p,'_');p1!=NULL;p1=strchr(p1+1,'_')) {
  542.      char buff[256];
  543.      p2=p1+1;
  544.      if(*p2=='(') p2=find_matching(p2+1,')');
  545.      else p2=find_mathvar_end(p2);
  546.      if(p2==NULL || p2>p1+64) continue;
  547.      if(*(p1+1)=='(') p2++;
  548.      memmove(buff,p1+1,p2-p1-1); buff[p2-p1-1]=0;
  549.      strip_enclosing_par(buff);
  550.      string_modify(p,p1,p2,"%s%s%s",SUBBEG,buff,SUBEND);}
  551. }
  552.  
  553. /* get rid of 1*.. ..*1  exemple : 1 * x, x/1 */
  554. void __replace_getrid1 (char *p)
  555. {   char *p1, *p2, *p3 ;
  556.     for(p1=p;*p1;p1++) {
  557.       if(*p1!='1') continue;
  558.       if(myisdigit(*(p1+1)) || *(p1+1)=='.' ||
  559.        (p1>p && (isalnum(*(p1-1)) || *(p1-1)=='.')) ) continue;
  560.       p2=find_word_start(p1+1);
  561.       if(p1>p+2 && (*(p1-1)=='-' || *(p1-1)=='+')) {
  562.         for(p3=p1-2; p3>p && isspace(*p3); p3--);
  563.         if(p3>p+1 && (*p3=='E' || *p3=='e')) { /* ??? */
  564.         p3--; while(p3>p && isspace(*p3)) p3--;
  565.         if(myisdigit(*p3) || *p3=='.') continue;
  566.         }
  567.       }
  568.       if(p1==p) p3="+";
  569.       else for(p3=p1-1;p3>p && isspace(*p3);p3--);
  570.       if(*p2=='*' && *p3!='/') {/* delete 1 if 1* or /1 */
  571.         ovlstrcpy(p1,p2+1);continue;
  572.       }
  573.       if(isalpha(*p2) && *p3!='/') {
  574.         ovlstrcpy(p1,p2);continue;
  575.       }
  576.       if(*p3=='/' && *p2!='<') ovlstrcpy(p3,p2);
  577.  
  578.     }
  579. }
  580.  
  581. /* get rid of '*' */
  582. void __replace_getridstar (char *p)
  583. { char *p1 ;
  584.  for(p1=strchr(p,'*');p1!=NULL;p1=strchr(p1+1,'*')) {
  585.     char *pq;
  586.     pq=find_word_start(p1+1);
  587.     if(myisdigit(*pq)) {
  588.         string_modify(p,p1,pq,"&times;");
  589.         continue;
  590.     }
  591.     if(p1>p && (isalpha(*(p1-1)) || *(p1-1)==')' || *(p1-1)=='>')
  592.        && (isalnum(*pq) || *pq=='$')) *p1=' ';
  593.     else {
  594.         ovlstrcpy(p1,p1+1);p1--;
  595.     }
  596.   }
  597. }
  598.  
  599. /* <=, >=, ->, =>, <=>
  600.  * if int n != 0, use html code, else use tex code
  601.  */
  602.  
  603. void __replace_arrow ( char *p, int n)
  604. {   char *p1, *p2, *m_prefix;
  605.     if (n) m_prefix="$m_"; else m_prefix="\\";
  606.  
  607.     for(p1=strstr(p,"&lt;="); p1!=NULL; p1=strstr(p1+1,"&lt;=")) {
  608.       if(*(p1+5)!='&' && *(p1+5)!='=')
  609.         string_modify(p,p1,p1+5, "%sle",m_prefix);
  610.       else {
  611.           for(p2=p1+5; *p2=='='; p2++);
  612.           if(strncmp(p2,"&gt;",4)==0) {
  613.             if(p2>p1+5) { string_modify(p,p1,p2+4,"%sLongleftrightarrow",m_prefix);}
  614.             else { string_modify(p,p1,p2+4,"%sLeftrightarrow",m_prefix);}
  615.           }
  616.           else { string_modify(p,p1,p2,"%sLongleftarrow",m_prefix);}
  617.       }
  618.     }
  619.     for(p1=strstr(p,"&gt;="); p1!=NULL; p1=strstr(p1+1,"&gt;=")) {
  620.       if(*(p1+5)!='=') { string_modify(p,p1,p1+5,"%sge",m_prefix);}
  621.     }
  622.     for(p1=strstr(p,"-&gt;"); p1; p1=strstr(p1+1,"-&gt;")) {
  623.       for(p2=p1; p2>p && *(p2-1)=='-'; p2--);
  624.       if(p2>p && *(p2-1)==';') continue;
  625.       if(p2<p1) { string_modify(p,p2,p1+5,"%slongrightarrow",m_prefix);}
  626.       else {  string_modify(p,p1,p1+5,"%srightarrow",m_prefix);}
  627.     }
  628.     for(p1=strstr(p,"=&gt;"); p1; p1=strstr(p1+1,"=&gt;")) {
  629.       for(p2=p1; p2>p && *(p2-1)=='='; p2--);
  630.       if(p2>p && *(p2-1)==';') continue;
  631.       if(p2<p1) { string_modify(p,p2,p1+5,"%sLongrightarrow",m_prefix);}
  632.       else { string_modify(p,p1,p1+5,"%sRightarrow",m_prefix) ;}
  633.     }
  634. /* Not equal */
  635.     for(p1=strstr(p,"!="); p1; p1=strstr(p1+1,"!=")) {
  636.       if(p1>p && !isspace(*(p1-1))) continue;
  637.        string_modify(p,p1,p1+2,"%sneq",m_prefix);
  638.     }
  639. }
  640.  
  641. /* why <tt> is used sometimes ? replace single characters by italics one
  642.  * is it useful in mathml ?
  643.  */
  644. void __replace_italics (char *p, int n)
  645. { char *p1, *p2, *p3, pbuf[16];
  646.   char *ITBEG, *ITEND, *ITtBEG, *ITtEND;
  647.    if (n) {
  648.      ITBEG = "<i>";ITtBEG = "<i><tt>";
  649.      ITEND = "</i>";ITtEND = "</tt></i>";
  650.   } else {;
  651.      ITBEG = "" ; ITtBEG = "";
  652.      ITEND = ""; ITtEND = "";
  653.   }
  654.  
  655.   for(p1=p;*p1;p1++) {
  656.     if(*p1=='<') {
  657.         p1=strchr(p1,'>'); if(p1==NULL) break; //recognize an html tag < >
  658.         else continue;
  659.     }
  660.     if(*p1=='=' && *(p1+1)=='-') {
  661.         string_modify(p,p1+1,p1+1," "); p1+=2; continue;
  662.     }
  663.     if(*p1=='\'') {
  664.         for(p2=p1+1;*p2=='\'';p2++);
  665.         memmove(pbuf,p1,p2-p1); pbuf[p2-p1]=0;
  666.         string_modify(p,p1,p2,"%s%s%s",ITtBEG,pbuf,ITtEND);
  667.         p1=p2+strlen(ITtBEG)+strlen(ITtEND)-1;
  668.         continue;
  669.     }
  670.     if(!isalpha(*p1)) continue;
  671. /* unique letter.*/
  672.     for(p2=p1+1;isalpha(*p2);p2++);
  673.     p3=find_word_start(p2);
  674.     if(p2>p1+5 ||
  675.        (p2>p1+1 && (*p3==';' || *p3=='(' || myisdigit(*p2))))
  676.         {p1=p2-1; continue;}
  677.     if(strncasecmp(p3,"</i>",strlen("</i>"))==0) continue;
  678.     memmove(pbuf,p1,p2-p1); pbuf[p2-p1]=0;
  679.     string_modify(p,p1,p2,"%s%s%s",ITBEG,pbuf,ITEND);
  680.     p1=p2+strlen(ITBEG)+strlen(ITEND)-1;
  681.     }
  682. }
  683.  
  684. /* float (1.2 E-03) : 3E+021 -> 3 × 10^{21} - 3E-21 -> 3 × 10^{-21}
  685.  * or replace variable name (alpha)
  686.  * if int n != 0, use html code, else use tex code
  687.  */
  688. void __replace_mathvar(char *p,int n)
  689. { char *p1, *p2, *p3;
  690.   char *EXPBEG, *EXPEND, *EXPBEGMINUS, *SUBBEG, *SUBEND, *m_prefix;
  691.  
  692.   if ( n ) {
  693.      EXPBEG = " &times; 10<sup>";
  694.      EXPBEGMINUS = " &times; 10<sup>-";
  695.      EXPEND = "</sup>";
  696.      SUBBEG = "<sub>";
  697.      SUBEND = "</sub>";
  698.      m_prefix="$m_";
  699.   } else {
  700.      EXPBEG = " \\times 10^{" ;
  701.      EXPBEGMINUS = " \\times 10^{-" ;
  702.      EXPEND = "}";
  703.      SUBBEG = "_{";
  704.      SUBEND = "}";
  705.      m_prefix="\\";
  706.   }
  707.   for (p1=find_mathvar_start(p);*p1!=0;p1=find_mathvar_start(p2)) {
  708.     char buf[MAX_LINELEN+1];
  709. /* if the variable is preceded by \ do nothing
  710.  * in fact this should not arrive
  711.  */
  712.     if (p1>p && *(p1-1) == '\\' ) break ;
  713.     p2 = find_mathvar_end(p1);
  714.         if (p1 == p2) break;
  715.     memmove(buf,p1,p2-p1);buf[p2-p1]=0;
  716.  
  717.     if(myisdigit(buf[0])) {
  718. /* number : 3E+021 -> 3 x 10^{21} - 3E-21 -> 3 x 10^{-21} */
  719.         int k = 1, minus = 0;
  720.  
  721. /* see putnumber in texmath.c*/
  722.         if( (p3 = strpbrk(buf, "Ee")) == NULL) continue;
  723.         p1 += p3-buf;
  724.             //count the number of 0, +, -
  725.         if (*(p1+k) == '-') { minus = 1; k++; }
  726.         while(*(p1+k)=='0' || *(p1+k)=='+') k++;
  727.  
  728.         string_modify(p,p1,p1+k, minus? EXPBEGMINUS: EXPBEG);
  729.         p2 += strlen(minus? EXPBEGMINUS: EXPBEG)-k;
  730.         string_modify(p,p2,p2, EXPEND);
  731.         p2 += strlen(EXPEND);
  732.     } else {
  733. /* alphabetic name, replace greek letters and symbols in hmname
  734.  * not done in texmath.c
  735.  */
  736.         int i = search_list(hmname,hmname_no,sizeof(hmname[0]),buf);
  737.         char *n, *r;
  738.         if(i<0) { /* not in list */
  739.                 int k = strlen(buf)-1;
  740.             if(myisdigit(buf[k])) {
  741.                while(k>0 && myisdigit(buf[k-1])) k--;
  742.                string_modify(buf,buf+k,buf+k,SUBBEG);
  743.                string_modify(p,p1,p2,"%s%s",buf,SUBEND);
  744.                p2+=strlen(SUBBEG)+strlen(SUBEND);
  745.             }
  746.             continue;
  747.         }
  748.         n = hmname[i].name;
  749.         r = mathalign_base < 2? hmname[i].replace: hmname[i].replacem;
  750.         if(r[0]==0) { /* replace = "" */
  751.                 string_modify(p,p1,p2,"%s%s",m_prefix, n);
  752.                 p2 = p1+strlen(n)+strlen(m_prefix);
  753.         } else {
  754.                 string_modify(p,p1,p2,"%s",r);
  755.                 p2 = p1+strlen(r);
  756.             }
  757.         }
  758.   }
  759. }
  760.  
  761. /* translate raw math expression coming from calculators into best html way
  762.  * if int n != 0, use html code, else use tex code
  763.  */
  764. void __htmlmath(char *p,int n)
  765. {
  766.     if(!rawmath_easy) { rawmath_easy=1; rawmath(p); rawmath_easy=0;}
  767.     __replace_htmlmath_gtlt(p); //only used in deductio
  768.     __replace_exponent(p,n);
  769.     __replace_subscript(p,n);
  770.     __replace_getrid1(p);
  771.     __replace_mathvar(p,n);
  772.     __replace_getridstar(p);
  773.     __replace_arrow(p,n);
  774. /* Now make substitutions */
  775.     substit(p);
  776. /* Make single names italic - done automatically by mathml */
  777.    __replace_italics(p,n);
  778.    strip_trailing_spaces(p);
  779. }
  780.  
  781. void htmlmath(char *p)
  782. {
  783.  __htmlmath(p,1) ;
  784. }
  785.  
  786. /* if mathml is closed, it will be just htmlmath*/
  787.  
  788. void mathmlmath(char *p)
  789. {
  790.     if (mathalign_base == 2) { __htmlmath(p,0) ; mathml(p,1);} else { __htmlmath(p,1) ;}
  791. }
  792.