1999-09-27 18:44:28 +00:00
|
|
|
// Generalized simple lexical analizer.
|
|
|
|
// It can be used for simple syntax parsers, like lyxrc,
|
|
|
|
// texclass and others to come. [asierra30/03/96]
|
|
|
|
//
|
|
|
|
// (C) 1996 Lyx Team.
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
#include <cstdlib>
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
#ifdef __GNUG__
|
|
|
|
#pragma implementation "lyxlex.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "lyxlex.h"
|
1999-10-07 18:44:17 +00:00
|
|
|
#include "debug.h"
|
1999-10-02 16:21:10 +00:00
|
|
|
#include "support/filetools.h"
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
LyXLex::LyXLex(keyword_item * tab, int num)
|
2000-01-06 02:44:26 +00:00
|
|
|
: is(&fb__), table(tab), no_items(num)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-01-06 02:44:26 +00:00
|
|
|
|
1999-09-27 18:44:28 +00:00
|
|
|
status = 0;
|
1999-10-02 16:21:10 +00:00
|
|
|
pushed = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
void LyXLex::pushTable(keyword_item * tab, int num)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
pushed_table * tmppu = new pushed_table;
|
1999-09-27 18:44:28 +00:00
|
|
|
tmppu->next = pushed;
|
|
|
|
tmppu->table_elem = table;
|
|
|
|
tmppu->table_siz = no_items;
|
|
|
|
pushed = tmppu;
|
|
|
|
table = tab;
|
|
|
|
no_items = num;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void LyXLex::popTable()
|
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
if (pushed == 0)
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr << "LyXLex error: nothing to pop!" << endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
pushed_table * tmp;
|
1999-09-27 18:44:28 +00:00
|
|
|
tmp = pushed;
|
|
|
|
table = tmp->table_elem;
|
|
|
|
no_items = tmp->table_siz;
|
1999-10-02 16:21:10 +00:00
|
|
|
tmp->table_elem = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
pushed = tmp->next;
|
|
|
|
delete tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void LyXLex::printTable()
|
|
|
|
{
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr << "\nNumber of tags: " << no_items << endl;
|
1999-12-01 00:57:31 +00:00
|
|
|
for(int i= 0; i < no_items; ++i)
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr << "table[" << i
|
|
|
|
<< "]: tag: `" << table[i].tag
|
|
|
|
<< "' code:" << table[i].code << endl;
|
|
|
|
lyxerr << endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-12-01 00:57:31 +00:00
|
|
|
void LyXLex::printError(string const & message) const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
string tmpmsg = subst(message, "$$Token", GetString());
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr << "LyX: " << tmpmsg << " [around line " << lineno
|
|
|
|
<< " of file " << MakeDisplayPath(name) << ']' << endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
bool LyXLex::setFile(string const & filename)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-01-06 02:44:26 +00:00
|
|
|
if (fb__.is_open())
|
|
|
|
lyxerr << "Error in LyXLex::setFile: "
|
|
|
|
"file or stream already set." << endl;
|
|
|
|
fb__.open(filename.c_str(), ios::in);
|
|
|
|
is.rdbuf(&fb__);
|
1999-09-27 18:44:28 +00:00
|
|
|
name = filename;
|
|
|
|
lineno = 0;
|
2000-01-06 02:44:26 +00:00
|
|
|
return fb__.is_open() && is.good();
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
void LyXLex::setStream(istream & i)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-01-06 02:44:26 +00:00
|
|
|
if (fb__.is_open() || is.rdbuf()->in_avail())
|
|
|
|
lyxerr << "Error in LyXLex::setStream: "
|
|
|
|
"file or stream already set." << endl;
|
|
|
|
is.rdbuf(i.rdbuf());
|
|
|
|
lineno = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int LyXLex::lex()
|
|
|
|
{
|
|
|
|
//NOTE: possible bug.
|
2000-01-06 02:44:26 +00:00
|
|
|
if (next() && status == LEX_TOKEN)
|
|
|
|
return search_kw(buff);
|
|
|
|
else
|
|
|
|
return status;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-12-01 00:57:31 +00:00
|
|
|
int LyXLex::GetInteger() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-01-06 02:44:26 +00:00
|
|
|
if (buff[0] > ' ')
|
|
|
|
return atoi(buff);
|
|
|
|
else {
|
|
|
|
printError("Bad integer `$$Token'");
|
|
|
|
return -1;
|
|
|
|
}
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-12-01 00:57:31 +00:00
|
|
|
float LyXLex::GetFloat() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-12-01 00:57:31 +00:00
|
|
|
if (buff[0] > ' ')
|
|
|
|
return atof(buff);
|
1999-09-27 18:44:28 +00:00
|
|
|
else {
|
|
|
|
printError("Bad float `$$Token'");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
string LyXLex::GetString() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
return string(buff);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// I would prefer to give a tag number instead of an explicit token
|
|
|
|
// here, but it is not possible because Buffer::readLyXformat2 uses
|
|
|
|
// explicit tokens (JMarc)
|
1999-10-02 16:21:10 +00:00
|
|
|
string LyXLex::getLongString(string const & endtoken)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
1999-10-02 16:21:10 +00:00
|
|
|
string str, prefix;
|
1999-09-27 18:44:28 +00:00
|
|
|
bool firstline = true;
|
|
|
|
|
|
|
|
while (IsOK()) {
|
|
|
|
if (!EatLine())
|
|
|
|
// blank line in the file being read
|
|
|
|
continue;
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
string const token = frontStrip(strip(GetString()), " \t");
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr[Debug::PARSER] << "LongString: `"
|
|
|
|
<< GetString() << '\'' << endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// We do a case independent comparison, like search_kw
|
|
|
|
// does.
|
1999-10-02 16:21:10 +00:00
|
|
|
if (compare_no_case(token, endtoken) != 0) {
|
|
|
|
string tmpstr = GetString();
|
1999-09-27 18:44:28 +00:00
|
|
|
if (firstline) {
|
1999-10-02 16:21:10 +00:00
|
|
|
unsigned int i = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
while(i < tmpstr.length()
|
|
|
|
&& tmpstr[i] == ' ') {
|
1999-10-02 16:21:10 +00:00
|
|
|
++i;
|
1999-09-27 18:44:28 +00:00
|
|
|
prefix += ' ';
|
|
|
|
}
|
|
|
|
firstline = false;
|
1999-10-07 18:44:17 +00:00
|
|
|
lyxerr[Debug::PARSER] << "Prefix = `" << prefix
|
|
|
|
<< '\'' << endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!prefix.empty()
|
1999-10-02 16:21:10 +00:00
|
|
|
&& prefixIs(tmpstr, prefix.c_str())) {
|
|
|
|
tmpstr.erase(0, prefix.length() - 1);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
str += tmpstr + '\n';
|
|
|
|
}
|
|
|
|
else // token == endtoken
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!IsOK())
|
|
|
|
printError("Long string not ended by `" + endtoken + '\'');
|
|
|
|
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-12-01 00:57:31 +00:00
|
|
|
bool LyXLex::GetBool() const
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
2000-01-06 02:44:26 +00:00
|
|
|
if (compare(buff, "true") == 0)
|
|
|
|
return true;
|
|
|
|
else if (compare(buff, "false") != 0)
|
|
|
|
printError("Bad boolean `$$Token'. Use \"false\" or \"true\"");
|
|
|
|
return false;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool LyXLex::EatLine()
|
|
|
|
{
|
1999-12-01 00:57:31 +00:00
|
|
|
int i = 0;
|
2000-01-06 02:44:26 +00:00
|
|
|
unsigned char c = '\0';
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
while(is && c != '\n' && i != (LEX_MAX_BUFF - 1)) {
|
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
if (c != '\r')
|
|
|
|
buff[i++] = c;
|
|
|
|
}
|
2000-01-06 02:44:26 +00:00
|
|
|
if (i == (LEX_MAX_BUFF - 1) && c != '\n') {
|
|
|
|
printError("Line too long");
|
1999-09-27 18:44:28 +00:00
|
|
|
c = '\n'; // Pretend we had an end of line
|
1999-10-02 16:21:10 +00:00
|
|
|
--lineno; // but don't increase line counter (netto effect)
|
|
|
|
++i; // and preserve last character read.
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n') {
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
buff[--i] = '\0'; // i can never be 0 here, so no danger
|
|
|
|
status = LEX_DATA;
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
buff[i] = '\0';
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int LyXLex::search_kw(char const * const tag) const
|
|
|
|
{
|
1999-12-01 00:57:31 +00:00
|
|
|
int m, k = 0 , l = 0, r = no_items;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
while (l < r) {
|
1999-12-01 00:57:31 +00:00
|
|
|
m = (l + r) / 2;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-10-07 18:44:17 +00:00
|
|
|
if (lyxerr.debugging(Debug::PARSER)) {
|
|
|
|
lyxerr << "LyXLex::search_kw: elem " << m
|
|
|
|
<< " tag " << table[m].tag
|
|
|
|
<< " search tag " << tag
|
|
|
|
<< endl;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (table[m].tag)
|
1999-10-02 16:21:10 +00:00
|
|
|
k = compare_no_case(table[m].tag, tag);
|
1999-11-15 12:01:38 +00:00
|
|
|
if (k == 0)
|
1999-09-27 18:44:28 +00:00
|
|
|
return table[m].code;
|
|
|
|
else
|
1999-12-01 00:57:31 +00:00
|
|
|
if (k < 0) l = m + 1; else r = m;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
1999-12-01 00:57:31 +00:00
|
|
|
return LEX_UNDEF;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool LyXLex::next(bool esc)
|
|
|
|
{
|
|
|
|
if (!esc) {
|
2000-01-06 02:44:26 +00:00
|
|
|
unsigned char c; // getc() returns an int
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
status = 0;
|
2000-01-06 02:44:26 +00:00
|
|
|
while (is && !status) {
|
|
|
|
is.get(c);
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '#') {
|
1999-09-27 18:44:28 +00:00
|
|
|
// Read rest of line (fast :-)
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(buff, sizeof(buff));
|
|
|
|
lyxerr[Debug::LYXLEX] << "Comment read: " << c << buff << endl;
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\"') {
|
1999-10-07 18:44:17 +00:00
|
|
|
int i = -1;
|
1999-09-27 18:44:28 +00:00
|
|
|
do {
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
if (c != '\r')
|
|
|
|
buff[++i] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
} while (c != '\"' && c != '\n' && is &&
|
|
|
|
i != (LEX_MAX_BUFF - 2));
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (i == (LEX_MAX_BUFF - 2)) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Line too long");
|
|
|
|
c = '\"'; // Pretend we got a "
|
1999-10-02 16:21:10 +00:00
|
|
|
++i;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c != '\"') {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Missing quote");
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n')
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_DATA;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == ',')
|
1999-09-27 18:44:28 +00:00
|
|
|
continue; /* Skip ','s */
|
2000-01-06 02:44:26 +00:00
|
|
|
|
|
|
|
// using relational operators with chars other
|
|
|
|
// than == and != is not safe. And if it is done
|
|
|
|
// the type _have_ to be unsigned. It usually a
|
|
|
|
// lot better to use the functions from cctype
|
|
|
|
if (c > ' ' && is) {
|
|
|
|
#warning Verify this! (Lgb)
|
|
|
|
//if (isalnum(static_cast<unsigned char>(c)) && is) {
|
1999-10-07 18:44:17 +00:00
|
|
|
int i = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
do {
|
|
|
|
buff[i++] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
|
|
|
} while (c > ' ' && c != ',' && is
|
|
|
|
//} while (isalnum(static_cast<unsigned char>(c))
|
|
|
|
//&& c != ',' && is
|
|
|
|
&& (i != LEX_MAX_BUFF - 1) );
|
|
|
|
if (i == LEX_MAX_BUFF - 1) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Line too long");
|
|
|
|
}
|
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_TOKEN;
|
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c == '\r' && is) {
|
1999-09-27 18:44:28 +00:00
|
|
|
// The Windows support has lead to the
|
|
|
|
// possibility of "\r\n" at the end of
|
|
|
|
// a line. This will stop LyX choking
|
|
|
|
// when it expected to find a '\n'
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n')
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
if (status) return true;
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
status = is.eof() ? LEX_FEOF: LEX_UNDEF;
|
1999-09-27 18:44:28 +00:00
|
|
|
buff[0] = '\0';
|
|
|
|
return false;
|
|
|
|
} else {
|
2000-01-06 02:44:26 +00:00
|
|
|
unsigned char c; // getc() returns an int
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
status = 0;
|
2000-01-06 02:44:26 +00:00
|
|
|
while (is && !status) {
|
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
// skip ','s
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == ',') continue;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\\') {
|
1999-09-27 18:44:28 +00:00
|
|
|
// escape
|
1999-10-07 18:44:17 +00:00
|
|
|
int i = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
do {
|
|
|
|
if (c == '\\') {
|
|
|
|
// escape the next char
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
buff[i++] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
|
|
|
} while (c > ' ' && c != ',' && is
|
|
|
|
//} while (isalnum(static_cast<unsigned char>(c))
|
|
|
|
//&& c != ',' && is
|
|
|
|
&& (i != LEX_MAX_BUFF - 1) );
|
|
|
|
if (i == LEX_MAX_BUFF - 1) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Line too long");
|
|
|
|
}
|
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_TOKEN;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '#') {
|
1999-09-27 18:44:28 +00:00
|
|
|
// Read rest of line (fast :-)
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(buff, sizeof(buff));
|
|
|
|
lyxerr[Debug::LYXLEX] << "Comment read: " << c << buff << endl;
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// string
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\"') {
|
1999-10-07 18:44:17 +00:00
|
|
|
int i = -1;
|
1999-09-27 18:44:28 +00:00
|
|
|
bool escaped = false;
|
|
|
|
do {
|
|
|
|
escaped = false;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
if (c == '\r') continue;
|
|
|
|
if (c == '\\') {
|
|
|
|
// escape the next char
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
escaped = true;
|
|
|
|
}
|
|
|
|
buff[++i] = c;
|
|
|
|
|
|
|
|
if (!escaped && c == '\"') break;
|
2000-01-06 02:44:26 +00:00
|
|
|
} while (c != '\n' && is &&
|
|
|
|
i != (LEX_MAX_BUFF - 2));
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (i == (LEX_MAX_BUFF - 2)) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Line too long");
|
|
|
|
c = '\"'; // Pretend we got a "
|
1999-10-02 16:21:10 +00:00
|
|
|
++i;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c != '\"') {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Missing quote");
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n')
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_DATA;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c > ' ' && is) {
|
|
|
|
//if (isalnum(static_cast<unsigned char>(c)) && is) {
|
1999-10-07 18:44:17 +00:00
|
|
|
int i = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
do {
|
|
|
|
if (c == '\\') {
|
|
|
|
// escape the next char
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
//escaped = true;
|
|
|
|
}
|
|
|
|
buff[i++] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
|
|
|
} while (c > ' ' && c != ',' && is
|
|
|
|
//} while (isalnum(static_cast<unsigned char>(c))
|
|
|
|
//!= ',' && is
|
|
|
|
&& (i != LEX_MAX_BUFF-1) );
|
1999-09-27 18:44:28 +00:00
|
|
|
if (i == LEX_MAX_BUFF-1) {
|
|
|
|
printError("Line too long");
|
|
|
|
}
|
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_TOKEN;
|
|
|
|
}
|
|
|
|
// new line
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n')
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (status) return true;
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
status = is.eof() ? LEX_FEOF: LEX_UNDEF;
|
1999-09-27 18:44:28 +00:00
|
|
|
buff[0] = '\0';
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool LyXLex::nextToken()
|
|
|
|
{
|
|
|
|
status = 0;
|
2000-01-06 02:44:26 +00:00
|
|
|
while (is && !status) {
|
|
|
|
unsigned char c;
|
|
|
|
is.get(c);
|
1999-09-27 18:44:28 +00:00
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c >= ' ' && is) {
|
|
|
|
//if (isprint(static_cast<unsigned char>(c)) && is) {
|
1999-12-01 00:57:31 +00:00
|
|
|
int i = 0;
|
1999-09-27 18:44:28 +00:00
|
|
|
if (c == '\\') { // first char == '\\'
|
|
|
|
do {
|
|
|
|
buff[i++] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
|
|
|
} while (c > ' ' && c != '\\' && is
|
|
|
|
//} while (isalnum(static_cast<unsigned char>(c))
|
|
|
|
// && c != '\\' && is
|
|
|
|
&& i != (LEX_MAX_BUFF-1));
|
1999-09-27 18:44:28 +00:00
|
|
|
} else {
|
|
|
|
do {
|
|
|
|
buff[i++] = c;
|
2000-01-06 02:44:26 +00:00
|
|
|
is.get(c);
|
|
|
|
} while (c >= ' ' && c != '\\' && is
|
|
|
|
//} while (isprint(static_cast<unsigned char>(c))
|
|
|
|
// && c != '\\' && is
|
1999-09-27 18:44:28 +00:00
|
|
|
&& i != (LEX_MAX_BUFF-1));
|
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (i == (LEX_MAX_BUFF - 1)) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Line too long");
|
|
|
|
}
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
if (c == '\\') is.putback(c); // put it back
|
1999-09-27 18:44:28 +00:00
|
|
|
buff[i] = '\0';
|
|
|
|
status = LEX_TOKEN;
|
|
|
|
}
|
|
|
|
|
1999-11-15 12:01:38 +00:00
|
|
|
if (c == '\n')
|
1999-10-02 16:21:10 +00:00
|
|
|
++lineno;
|
1999-09-27 18:44:28 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
if (status) return true;
|
|
|
|
|
2000-01-06 02:44:26 +00:00
|
|
|
status = is.eof() ? LEX_FEOF: LEX_UNDEF;
|
1999-09-27 18:44:28 +00:00
|
|
|
buff[0] = '\0';
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
int LyXLex::FindToken(char const * str[])
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
int i = -1;
|
|
|
|
|
|
|
|
if (next()) {
|
1999-10-02 16:21:10 +00:00
|
|
|
if (compare(buff, "default")) {
|
|
|
|
for (i = 0; str[i][0] && compare(str[i], buff); ++i);
|
|
|
|
if (!str[i][0]) {
|
1999-09-27 18:44:28 +00:00
|
|
|
printError("Unknown argument `$$Token'");
|
|
|
|
i = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
printError("file ended while scanning string token");
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
int LyXLex::CheckToken(char const * str[], int print_error)
|
1999-09-27 18:44:28 +00:00
|
|
|
{
|
|
|
|
int i = -1;
|
|
|
|
|
1999-10-02 16:21:10 +00:00
|
|
|
if (compare(buff, "default")) {
|
1999-12-01 00:57:31 +00:00
|
|
|
for (i = 0; str[i][0] && compare(str[i], buff); ++i);
|
1999-10-02 16:21:10 +00:00
|
|
|
if (!str[i][0]) {
|
1999-09-27 18:44:28 +00:00
|
|
|
if (print_error)
|
|
|
|
printError("Unknown argument `$$Token'");
|
|
|
|
i = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return i;
|
|
|
|
}
|