python (65.2k questions)

javascript (44.3k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (13k questions)

Questions - lexical-analysis

Using flex to identify variable name without repeating characters

I'm not fully sure how to word my question, so sorry for the rough title. I am trying to create a pattern that can identify variable names with the following restraints: Must begin with a letter Firs...
test-img

VectorsAreCool123

flexbox

lexer

lexical-analysis

Votes: 0

Answers: 1

Latest Answer

The easiest way to handle that sort of requirement is to have one pattern which matches the exceptional string and another pattern, which comes afterwards in the file, which matches all the strings: [...
test-img

rici

How To Count All Operands And Operators in a Java File

I have a java file and i want to count the number of binary,unary,logical operators,and operands in it.I just know i need to use regex for it and i know the basic of it.The task might be simple but ...
test-img

user15465584

java

file

operators

lexical-analysis

operands

Votes: 0

Answers: 1

Latest Answer

Your best bet is probably going to be to process the entire file with regexes to remove comments entirely -- to get an entire new version of the file -- and then to scan for operators.
test-img

Louis Wasserman

Evaluation order of augmented operators (delimiters) in python

If I evaluate the following minimal example in python a = [1, 2, 3] a[-1] += a.pop() I get [1, 6] So it seems that this is evaluated as a[-1] = a[-1] + a.pop() where each expression/operand would b...
test-img

tobias_t

python

operator-precedence

lexical-analysis

Votes: 0

Answers: 2

Latest Answer

Let me start with the question you asked at the end: I want to understand if augmented operators have to be treated in a special way (i.e. by expanding them) during lexical analysis, That one is sim...
test-img

rici

How do I find the regular expression for- All binary numbers greater than 110011

I am trying to solve a problem set to practice for an exam. How can I approach questions like these ? Is there a way to verify solutions or is it just trial and error ?
test-img

Ash Rivers

regex

binary

binary-data

lexical-analysis

Votes: 0

Answers: 1

Latest Answer

This one seems quite simple: the string has to be one of: 1 followed by at least six more characters. 111 followed by at least (or exactly) three characters 1111 followed by at least (or exactly) two...
test-img

rici

Posts

Questions

Blogs

Jobs